Base | Representation |
---|---|
bin | 1100000010000110110010… |
… | …1101000011010011100110 |
3 | 1201211210202221220021200212 |
4 | 3000201230231003103212 |
5 | 3213231200143133110 |
6 | 44045532042135422 |
7 | 2533600511104463 |
oct | 300415455032346 |
9 | 51753687807625 |
10 | 13230323021030 |
11 | 4240a48482455 |
12 | 15981604b1572 |
13 | 74c7ca26a98b |
14 | 33a4cb3d866a |
15 | 17e23ec8ee05 |
hex | c086cb434e6 |
13230323021030 has 32 divisors (see below), whose sum is σ = 24341162287104. Its totient is φ = 5175295386976.
The previous prime is 13230323021021. The next prime is 13230323021093. The reversal of 13230323021030 is 3012032303231.
It is a super-3 number, since 3×132303230210303 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13230323020987 and 13230323021005.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 10933622 + ... + 12083241.
It is an arithmetic number, because the mean of its divisors is an integer number (760661321472).
Almost surely, 213230323021030 is an apocalyptic number.
13230323021030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13230323021030 is a deficient number, since it is larger than the sum of its proper divisors (11110839266074).
13230323021030 is a wasteful number, since it uses less digits than its factorization.
13230323021030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23018140.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 13230323021030 its reverse (3012032303231), we get a palindrome (16242355324261).
The spelling of 13230323021030 in words is "thirteen trillion, two hundred thirty billion, three hundred twenty-three million, twenty-one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •