Base | Representation |
---|---|
bin | 1100000111100000011101… |
… | …1000000100001010101110 |
3 | 1202011200021121022002221021 |
4 | 3001320013120010022232 |
5 | 3221241213222114410 |
6 | 44200315302324354 |
7 | 2543364100011334 |
oct | 301700730041256 |
9 | 52150247262837 |
10 | 13323112301230 |
11 | 4277333619a96 |
12 | 15b21374296ba |
13 | 758496c05ac4 |
14 | 340bb0929b54 |
15 | 181870e39eda |
hex | c1e076042ae |
13323112301230 has 8 divisors (see below), whose sum is σ = 23981602142232. Its totient is φ = 5329244920488.
The previous prime is 13323112301189. The next prime is 13323112301249. The reversal of 13323112301230 is 3210321132331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×133231123012302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13323112301195 and 13323112301204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 666155615052 + ... + 666155615071.
It is an arithmetic number, because the mean of its divisors is an integer number (2997700267779).
Almost surely, 213323112301230 is an apocalyptic number.
13323112301230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13323112301230 is a deficient number, since it is larger than the sum of its proper divisors (10658489841002).
13323112301230 is a wasteful number, since it uses less digits than its factorization.
13323112301230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1332311230130.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 13323112301230 its reverse (3210321132331), we get a palindrome (16533433433561).
The spelling of 13323112301230 in words is "thirteen trillion, three hundred twenty-three billion, one hundred twelve million, three hundred one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •