Base | Representation |
---|---|
bin | 101011110110000110101… |
… | …100111011111001100011 |
3 | 101200001011101021112012101 |
4 | 223312012230323321203 |
5 | 343331142143013443 |
6 | 10224100124311231 |
7 | 430453512303334 |
oct | 53660654737143 |
9 | 11601141245171 |
10 | 3013032001123 |
11 | a61902019041 |
12 | 407b423a2517 |
13 | 18b187727681 |
14 | a5b8d9d228b |
15 | 535988b784d |
hex | 2bd86b3be63 |
3013032001123 has 8 divisors (see below), whose sum is σ = 3015667017792. Its totient is φ = 3010398140736.
The previous prime is 3013032001121. The next prime is 3013032001151. The reversal of 3013032001123 is 3211002303103.
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 3013032001123 - 21 = 3013032001121 is a prime.
It is a super-2 number, since 2×30130320011232 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3013032001123.
It is not an unprimeable number, because it can be changed into a prime (3013032001121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4966461 + ... + 5540017.
It is an arithmetic number, because the mean of its divisors is an integer number (376958377224).
Almost surely, 23013032001123 is an apocalyptic number.
3013032001123 is a deficient number, since it is larger than the sum of its proper divisors (2635016669).
3013032001123 is a wasteful number, since it uses less digits than its factorization.
3013032001123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 578141.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 3013032001123 its reverse (3211002303103), we get a palindrome (6224034304226).
The spelling of 3013032001123 in words is "three trillion, thirteen billion, thirty-two million, one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •