Base | Representation |
---|---|
bin | 1011111100111110100111… |
… | …1110110111100100001000 |
3 | 1201112101101122100002101110 |
4 | 2333033221332313210020 |
5 | 3210310242003432222 |
6 | 43541242442250320 |
7 | 2524331503224462 |
oct | 277175176674410 |
9 | 51471348302343 |
10 | 13142230530312 |
11 | 4207652576314 |
12 | 15830764b69a0 |
13 | 7443cb6ab220 |
14 | 33613199b132 |
15 | 17bcd610630c |
hex | bf3e9fb7908 |
13142230530312 has 64 divisors (see below), whose sum is σ = 37464277092480. Its totient is φ = 3805894812672.
The previous prime is 13142230530307. The next prime is 13142230530389. The reversal of 13142230530312 is 21303503224131.
It is a self number, because there is not a number n which added to its sum of digits gives 13142230530312.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1238892748 + ... + 1238903355.
It is an arithmetic number, because the mean of its divisors is an integer number (585379329570).
Almost surely, 213142230530312 is an apocalyptic number.
13142230530312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13142230530312 is an abundant number, since it is smaller than the sum of its proper divisors (24322046562168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13142230530312 is a wasteful number, since it uses less digits than its factorization.
13142230530312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2477796142 (or 2477796138 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 30.
Adding to 13142230530312 its reverse (21303503224131), we get a palindrome (34445733754443).
The spelling of 13142230530312 in words is "thirteen trillion, one hundred forty-two billion, two hundred thirty million, five hundred thirty thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •