Base | Representation |
---|---|
bin | 10111101100011111111100… |
… | …001110010001000100011111 |
3 | 111122222200000202120000002022 |
4 | 113230133330032101010133 |
5 | 102124411232403214330 |
6 | 1005350445113050355 |
7 | 30644066601503450 |
oct | 2754377416210437 |
9 | 448880022500068 |
10 | 104213023101215 |
11 | 30229549792706 |
12 | b8312226b69bb |
13 | 461c3273603a2 |
14 | 1ba3d19a93127 |
15 | c0ac471b5ae5 |
hex | 5ec7fc39111f |
104213023101215 has 16 divisors (see below), whose sum is σ = 142922124311040. Its totient is φ = 71459655240480.
The previous prime is 104213023101197. The next prime is 104213023101289. The reversal of 104213023101215 is 512101320312401.
It is not a de Polignac number, because 104213023101215 - 214 = 104213023084831 is a prime.
It is a super-2 number, since 2×1042130231012152 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11036531 + ... + 18172260.
It is an arithmetic number, because the mean of its divisors is an integer number (8932632769440).
Almost surely, 2104213023101215 is an apocalyptic number.
104213023101215 is a deficient number, since it is larger than the sum of its proper divisors (38709101209825).
104213023101215 is a wasteful number, since it uses less digits than its factorization.
104213023101215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29310742.
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 104213023101215 its reverse (512101320312401), we get a palindrome (616314343413616).
The spelling of 104213023101215 in words is "one hundred four trillion, two hundred thirteen billion, twenty-three million, one hundred one thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •