Base | Representation |
---|---|
bin | 10100001100010… |
… | …10101111010101 |
3 | 102210201212001011 |
4 | 22012022233111 |
5 | 321330422023 |
6 | 24450332221 |
7 | 4124532343 |
oct | 1206125725 |
9 | 383655034 |
10 | 169389013 |
11 | 87685522 |
12 | 4888a071 |
13 | 2912a1b1 |
14 | 186d4993 |
15 | ed0e50d |
hex | a18abd5 |
169389013 has 4 divisors (see below), whose sum is σ = 169755328. Its totient is φ = 169022700.
The previous prime is 169389001. The next prime is 169389023. The reversal of 169389013 is 310983961.
169389013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 169389013 - 217 = 169257941 is a prime.
It is a super-2 number, since 2×1693890132 = 57385275450228338, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (169389023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 182463 + ... + 183388.
It is an arithmetic number, because the mean of its divisors is an integer number (42438832).
Almost surely, 2169389013 is an apocalyptic number.
It is an amenable number.
169389013 is a deficient number, since it is larger than the sum of its proper divisors (366315).
169389013 is an equidigital number, since it uses as much as digits as its factorization.
169389013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 366314.
The product of its (nonzero) digits is 34992, while the sum is 40.
The square root of 169389013 is about 13014.9534382571. The cubic root of 169389013 is about 553.3013703493.
The spelling of 169389013 in words is "one hundred sixty-nine million, three hundred eighty-nine thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •