Base | Representation |
---|---|
bin | 1001000111011010101000… |
… | …1001000101011110010000 |
3 | 1022111012011000122110010111 |
4 | 2101312222021011132100 |
5 | 2303204112340210000 |
6 | 33152301514011104 |
7 | 2053065416403100 |
oct | 221665211053620 |
9 | 38435130573114 |
10 | 10023013210000 |
11 | 321481072633a |
12 | 115a63aa16a94 |
13 | 579220b9134b |
14 | 26918b699200 |
15 | 125ac54b1cba |
hex | 91daa245790 |
10023013210000 has 150 divisors (see below), whose sum is σ = 28228631688510. Its totient is φ = 3436461504000.
The previous prime is 10023013209919. The next prime is 10023013210009. The reversal of 10023013210000 is 1231032001.
It can be written as a sum of positive squares in 5 ways, for example, as 2852207567104 + 7170805642896 = 1688848^2 + 2677836^2 .
It is not an unprimeable number, because it can be changed into a prime (10023013210009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 9737565 + ... + 10717564.
Almost surely, 210023013210000 is an apocalyptic number.
10023013210000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10023013210000 is an abundant number, since it is smaller than the sum of its proper divisors (18205618478510).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10023013210000 is an equidigital number, since it uses as much as digits as its factorization.
10023013210000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20455171 (or 20455143 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 10023013210000 its reverse (1231032001), we get a palindrome (10024244242001).
The spelling of 10023013210000 in words is "ten trillion, twenty-three billion, thirteen million, two hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •