Base | Representation |
---|---|
bin | 11000101001001010… |
… | …10010111111000101 |
3 | 1021011000222222110102 |
4 | 30110211102333011 |
5 | 204043414121201 |
6 | 10024453333445 |
7 | 645600020411 |
oct | 142445227705 |
9 | 37130888412 |
10 | 13230223301 |
11 | 567a130649 |
12 | 2692937285 |
13 | 132acab7c9 |
14 | 8d7177d41 |
15 | 52677b26b |
hex | 314952fc5 |
13230223301 has 8 divisors (see below), whose sum is σ = 13428543744. Its totient is φ = 13033377760.
The previous prime is 13230223297. The next prime is 13230223333. The reversal of 13230223301 is 10332203231.
13230223301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13230223301 - 22 = 13230223297 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13230223381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 350645 + ... + 386538.
It is an arithmetic number, because the mean of its divisors is an integer number (1678567968).
Almost surely, 213230223301 is an apocalyptic number.
It is an amenable number.
13230223301 is a deficient number, since it is larger than the sum of its proper divisors (198320443).
13230223301 is a wasteful number, since it uses less digits than its factorization.
13230223301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 737451.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 13230223301 its reverse (10332203231), we get a palindrome (23562426532).
The spelling of 13230223301 in words is "thirteen billion, two hundred thirty million, two hundred twenty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •