Base | Representation |
---|---|
bin | 1001011110101100101111… |
… | …1000010111110000001100 |
3 | 1100220102121120110022210102 |
4 | 2113223023320113300030 |
5 | 2331232311332243200 |
6 | 34100133143230232 |
7 | 2124015635333651 |
oct | 227531370276014 |
9 | 40812546408712 |
10 | 10423011212300 |
11 | 3359413113845 |
12 | 1204071448378 |
13 | 5a7b68c802cb |
14 | 28069549bc28 |
15 | 1311d6b136d5 |
hex | 97acbe17c0c |
10423011212300 has 36 divisors (see below), whose sum is σ = 22618081100160. Its totient is φ = 4169177430720.
The previous prime is 10423011212281. The next prime is 10423011212321. The reversal of 10423011212300 is 321211032401.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 23531477 + ... + 23970323.
It is an arithmetic number, because the mean of its divisors is an integer number (628280030560).
Almost surely, 210423011212300 is an apocalyptic number.
10423011212300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10423011212300 is an abundant number, since it is smaller than the sum of its proper divisors (12195069887860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10423011212300 is a wasteful number, since it uses less digits than its factorization.
10423011212300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 676370 (or 676363 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 10423011212300 its reverse (321211032401), we get a palindrome (10744222244701).
The spelling of 10423011212300 in words is "ten trillion, four hundred twenty-three billion, eleven million, two hundred twelve thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •