Base | Representation |
---|---|
bin | 101111100110001100… |
… | …1010011101111010011 |
3 | 100202211102121110022201 |
4 | 1133030121103233103 |
5 | 3133313114344243 |
6 | 114542312344031 |
7 | 10245641566540 |
oct | 1371431235723 |
9 | 322742543281 |
10 | 102213434323 |
11 | 3a391901070 |
12 | 179870a5017 |
13 | 983c265bb0 |
14 | 4d38dd7bc7 |
15 | 29d370c04d |
hex | 17cc653bd3 |
102213434323 has 32 divisors (see below), whose sum is σ = 137342822400. Its totient is φ = 73463794560.
The previous prime is 102213434299. The next prime is 102213434327. The reversal of 102213434323 is 323434312201.
It is a happy number.
It is not a de Polignac number, because 102213434323 - 29 = 102213433811 is a prime.
It is a super-2 number, since 2×1022134343232 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102213434291 and 102213434300.
It is not an unprimeable number, because it can be changed into a prime (102213434327) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1289853 + ... + 1366801.
It is an arithmetic number, because the mean of its divisors is an integer number (4291963200).
Almost surely, 2102213434323 is an apocalyptic number.
102213434323 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
102213434323 is a deficient number, since it is larger than the sum of its proper divisors (35129388077).
102213434323 is a wasteful number, since it uses less digits than its factorization.
102213434323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78307.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 102213434323 its reverse (323434312201), we get a palindrome (425647746524).
The spelling of 102213434323 in words is "one hundred two billion, two hundred thirteen million, four hundred thirty-four thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •