Base | Representation |
---|---|
bin | 1011110110100100011011… |
… | …1001101011011010101110 |
3 | 1201010212011212111220010210 |
4 | 2331221012321223122232 |
5 | 3202004240244114410 |
6 | 43414512354043250 |
7 | 2513353042556442 |
oct | 275510671533256 |
9 | 51125155456123 |
10 | 13032120301230 |
11 | 4174989188498 |
12 | 1565866879526 |
13 | 736c013c8914 |
14 | 330a87cc2822 |
15 | 178ede4d8220 |
hex | bda46e6b6ae |
13032120301230 has 64 divisors (see below), whose sum is σ = 31323160028160. Its totient is φ = 3470113851264.
The previous prime is 13032120301181. The next prime is 13032120301241. The reversal of 13032120301230 is 3210302123031.
It is a super-2 number, since 2×130321203012302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13032120301197 and 13032120301206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 464970477 + ... + 464998503.
It is an arithmetic number, because the mean of its divisors is an integer number (489424375440).
Almost surely, 213032120301230 is an apocalyptic number.
13032120301230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13032120301230 is an abundant number, since it is smaller than the sum of its proper divisors (18291039726930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13032120301230 is a wasteful number, since it uses less digits than its factorization.
13032120301230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50313.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 13032120301230 its reverse (3210302123031), we get a palindrome (16242422424261).
The spelling of 13032120301230 in words is "thirteen trillion, thirty-two billion, one hundred twenty million, three hundred one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •