Base | Representation |
---|---|
bin | 1011001100101010111001… |
… | …0101000111001100010011 |
3 | 1121121001012102120201200120 |
4 | 2303022232111013030103 |
5 | 3103211043031243103 |
6 | 42104105405121323 |
7 | 2410351204033410 |
oct | 263125625071423 |
9 | 47531172521616 |
10 | 12312301040403 |
11 | 3a17687a578a1 |
12 | 146a258859243 |
13 | 6b4077b56510 |
14 | 307cc0703107 |
15 | 1654104b7253 |
hex | b32ae547313 |
12312301040403 has 32 divisors (see below), whose sum is σ = 20222698406400. Its totient is φ = 6488648038656.
The previous prime is 12312301040399. The next prime is 12312301040423. The reversal of 12312301040403 is 30404010321321.
It is a happy number.
12312301040403 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12312301040403 - 22 = 12312301040399 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12312301040423) 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, 19665213 + ... + 20281646.
It is an arithmetic number, because the mean of its divisors is an integer number (631959325200).
Almost surely, 212312301040403 is an apocalyptic number.
12312301040403 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
12312301040403 is a deficient number, since it is larger than the sum of its proper divisors (7910397365997).
12312301040403 is a wasteful number, since it uses less digits than its factorization.
12312301040403 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39948011.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 12312301040403 its reverse (30404010321321), we get a palindrome (42716311361724).
The spelling of 12312301040403 in words is "twelve trillion, three hundred twelve billion, three hundred one million, forty thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •