Base | Representation |
---|---|
bin | 1011010011101001100110… |
… | …0101111011000101011011 |
3 | 1122000111201020121021210111 |
4 | 2310322121211323011123 |
5 | 3112142132311210021 |
6 | 42235140205425151 |
7 | 2422124544124156 |
oct | 264723145730533 |
9 | 48014636537714 |
10 | 12432212210011 |
11 | 3a6352075a370 |
12 | 148954286b1b7 |
13 | 6c247780b109 |
14 | 30da17d24c9d |
15 | 1685cc7728e1 |
hex | b4e9997b15b |
12432212210011 has 16 divisors (see below), whose sum is σ = 14124244428000. Its totient is φ = 10839049715200.
The previous prime is 12432212209987. The next prime is 12432212210063. The reversal of 12432212210011 is 11001221223421.
It is a cyclic number.
It is not a de Polignac number, because 12432212210011 - 27 = 12432212209883 is a prime.
It is a super-3 number, since 3×124322122100113 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12432212210071) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 130732510 + ... + 130827571.
It is an arithmetic number, because the mean of its divisors is an integer number (882765276750).
Almost surely, 212432212210011 is an apocalyptic number.
12432212210011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12432212210011 is a deficient number, since it is larger than the sum of its proper divisors (1692032217989).
12432212210011 is a wasteful number, since it uses less digits than its factorization.
12432212210011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261560270.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 12432212210011 its reverse (11001221223421), we get a palindrome (23433433433432).
The spelling of 12432212210011 in words is "twelve trillion, four hundred thirty-two billion, two hundred twelve million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •