Base | Representation |
---|---|
bin | 1011110110100000011000… |
… | …0110011100110011110110 |
3 | 1201010202101002210212220012 |
4 | 2331220012012130303312 |
5 | 3202000023440131410 |
6 | 43414212440140222 |
7 | 2513314102014623 |
oct | 275500606346366 |
9 | 51122332725805 |
10 | 13031033130230 |
11 | 4174480535865 |
12 | 1565602767672 |
13 | 736a8a0ba37b |
14 | 3309c376334a |
15 | 178e78d38605 |
hex | bda0619ccf6 |
13031033130230 has 8 divisors (see below), whose sum is σ = 23455859634432. Its totient is φ = 5212413252088.
The previous prime is 13031033130211. The next prime is 13031033130329. The reversal of 13031033130230 is 3203133013031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 13031033130196 and 13031033130205.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 651551656502 + ... + 651551656521.
It is an arithmetic number, because the mean of its divisors is an integer number (2931982454304).
Almost surely, 213031033130230 is an apocalyptic number.
13031033130230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13031033130230 is a deficient number, since it is larger than the sum of its proper divisors (10424826504202).
13031033130230 is a wasteful number, since it uses less digits than its factorization.
13031033130230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1303103313030.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 13031033130230 its reverse (3203133013031), we get a palindrome (16234166143261).
The spelling of 13031033130230 in words is "thirteen trillion, thirty-one billion, thirty-three million, one hundred thirty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •