Base | Representation |
---|---|
bin | 1011110110100100000010… |
… | …0001100000001000000110 |
3 | 1201010211220102011200100210 |
4 | 2331221000201200020012 |
5 | 3202004030401101410 |
6 | 43414454012420250 |
7 | 2513350303225251 |
oct | 275510041401006 |
9 | 51124812150323 |
10 | 13032013300230 |
11 | 4174933845011 |
12 | 1565836a77686 |
13 | 736bb51a3612 |
14 | 330a779cc098 |
15 | 178ed4dee220 |
hex | bda40860206 |
13032013300230 has 16 divisors (see below), whose sum is σ = 31276831920624. Its totient is φ = 3475203546720.
The previous prime is 13032013300223. The next prime is 13032013300279. The reversal of 13032013300230 is 3200331023031.
It is a super-2 number, since 2×130320133002302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13032013300197 and 13032013300206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 217200221641 + ... + 217200221700.
It is an arithmetic number, because the mean of its divisors is an integer number (1954801995039).
Almost surely, 213032013300230 is an apocalyptic number.
13032013300230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13032013300230 is an abundant number, since it is smaller than the sum of its proper divisors (18244818620394).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13032013300230 is a wasteful number, since it uses less digits than its factorization.
13032013300230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 434400443351.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 13032013300230 its reverse (3200331023031), we get a palindrome (16232344323261).
The spelling of 13032013300230 in words is "thirteen trillion, thirty-two billion, thirteen million, three hundred thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •