Base | Representation |
---|---|
bin | 1011110110011101101111… |
… | …0001100001111110101111 |
3 | 1201010200112121120200220012 |
4 | 2331213123301201332233 |
5 | 3201442100142101221 |
6 | 43414014151443435 |
7 | 2513260360025015 |
oct | 275473361417657 |
9 | 51120477520805 |
10 | 13030323003311 |
11 | 41741466a9a09 |
12 | 156544498657b |
13 | 7369a5c43723 |
14 | 3309573108b5 |
15 | 178e3681565b |
hex | bd9dbc61faf |
13030323003311 has 8 divisors (see below), whose sum is σ = 13050971103744. Its totient is φ = 13009680080280.
The previous prime is 13030323003307. The next prime is 13030323003329. The reversal of 13030323003311 is 11330032303031.
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 13030323003311 - 22 = 13030323003307 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 (13030323005311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3758786 + ... + 6339488.
It is an arithmetic number, because the mean of its divisors is an integer number (1631371387968).
Almost surely, 213030323003311 is an apocalyptic number.
13030323003311 is a deficient number, since it is larger than the sum of its proper divisors (20648100433).
13030323003311 is an equidigital number, since it uses as much as digits as its factorization.
13030323003311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2588701.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 13030323003311 its reverse (11330032303031), we get a palindrome (24360355306342).
The spelling of 13030323003311 in words is "thirteen trillion, thirty billion, three hundred twenty-three million, three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •