Base | Representation |
---|---|
bin | 1011110110000011101100… |
… | …0101000011001100001000 |
3 | 1201010000111101211000001102 |
4 | 2331200323011003030020 |
5 | 3201333240444133000 |
6 | 43410500334440532 |
7 | 2512622210454260 |
oct | 275407305031410 |
9 | 51100441730042 |
10 | 13023332021000 |
11 | 4171189454484 |
12 | 1564013663148 |
13 | 7361307771c2 |
14 | 330492a607a0 |
15 | 178b77bcd3d5 |
hex | bd83b143308 |
13023332021000 has 128 divisors (see below), whose sum is σ = 36342376911360. Its totient is φ = 4271005728000.
The previous prime is 13023332020997. The next prime is 13023332021017. The reversal of 13023332021000 is 12023332031.
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 (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 40284131 + ... + 40606130.
It is an arithmetic number, because the mean of its divisors is an integer number (283924819620).
Almost surely, 213023332021000 is an apocalyptic number.
13023332021000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13023332021000 is an abundant number, since it is smaller than the sum of its proper divisors (23319044890360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13023332021000 is a wasteful number, since it uses less digits than its factorization.
13023332021000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80890312 (or 80890298 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 13023332021000 its reverse (12023332031), we get a palindrome (13035355353031).
The spelling of 13023332021000 in words is "thirteen trillion, twenty-three billion, three hundred thirty-two million, twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •