Base | Representation |
---|---|
bin | 1001011110101100101101… |
… | …0111001011001111101000 |
3 | 1100220102120222002012220120 |
4 | 2113223023113023033220 |
5 | 2331232302120312222 |
6 | 34100132232523240 |
7 | 2124015501351510 |
oct | 227531327131750 |
9 | 40812528065816 |
10 | 10423002510312 |
11 | 335940920a917 |
12 | 120406a550520 |
13 | 5a7b672244c2 |
14 | 280694274840 |
15 | 1311d5e9515c |
hex | 97acb5cb3e8 |
10423002510312 has 64 divisors (see below), whose sum is σ = 29780469175680. Its totient is φ = 2977954516992.
The previous prime is 10423002510311. The next prime is 10423002510379. The reversal of 10423002510312 is 21301520032401.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (10423002510311) 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, 11224948 + ... + 12117980.
It is an arithmetic number, because the mean of its divisors is an integer number (465319830870).
Almost surely, 210423002510312 is an apocalyptic number.
10423002510312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10423002510312 is an abundant number, since it is smaller than the sum of its proper divisors (19357466665368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10423002510312 is a wasteful number, since it uses less digits than its factorization.
10423002510312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 962522 (or 962518 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 10423002510312 its reverse (21301520032401), we get a palindrome (31724522542713).
The spelling of 10423002510312 in words is "ten trillion, four hundred twenty-three billion, two million, five hundred ten thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •