Base | Representation |
---|---|
bin | 1011110110000010100100… |
… | …1101110000010010101000 |
3 | 1201002222201111212020222010 |
4 | 2331200221031300102220 |
5 | 3201332132233004000 |
6 | 43410410510555520 |
7 | 2512611611132103 |
oct | 275405115602250 |
9 | 51088644766863 |
10 | 13023032313000 |
11 | 417104525a416 |
12 | 1563b4b208ba0 |
13 | 7360b364c2a8 |
14 | 330464d2573a |
15 | 178b5b72ad50 |
hex | bd8293704a8 |
13023032313000 has 128 divisors (see below), whose sum is σ = 41297957475840. Its totient is φ = 3415877280000.
The previous prime is 13023032312999. The next prime is 13023032313007. The reversal of 13023032313000 is 31323032031.
It is not an unprimeable number, because it can be changed into a prime (13023032313007) 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 31 ways as a sum of consecutive naturals, for example, 35399056 + ... + 35765055.
It is an arithmetic number, because the mean of its divisors is an integer number (322640292780).
Almost surely, 213023032313000 is an apocalyptic number.
13023032313000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13023032313000 is an abundant number, since it is smaller than the sum of its proper divisors (28274925162840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13023032313000 is a wasteful number, since it uses less digits than its factorization.
13023032313000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71164196 (or 71164182 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 13023032313000 its reverse (31323032031), we get a palindrome (13054355345031).
The spelling of 13023032313000 in words is "thirteen trillion, twenty-three billion, thirty-two million, three hundred thirteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •