Base | Representation |
---|---|
bin | 101011110110010111011… |
… | …100111010101000110000 |
3 | 101200001212222001110211120 |
4 | 223312113130322220300 |
5 | 343332231112424240 |
6 | 10224144043342240 |
7 | 430463464003650 |
oct | 53662734725060 |
9 | 11601788043746 |
10 | 3013313014320 |
11 | a61a36704454 |
12 | 408000521980 |
13 | 18b200a0827b |
14 | a5bb9062360 |
15 | 535b33c5ad0 |
hex | 2bd9773aa30 |
3013313014320 has 160 divisors (see below), whose sum is σ = 10781438515200. Its totient is φ = 681937843200.
The previous prime is 3013313014307. The next prime is 3013313014331. The reversal of 3013313014320 is 234103133103.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (24).
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 31 ways as a sum of consecutive naturals, for example, 8709720 + ... + 9049079.
It is an arithmetic number, because the mean of its divisors is an integer number (67383990720).
Almost surely, 23013313014320 is an apocalyptic number.
3013313014320 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
3013313014320 is an abundant number, since it is smaller than the sum of its proper divisors (7768125500880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3013313014320 is a wasteful number, since it uses less digits than its factorization.
3013313014320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17758923 (or 17758917 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 3013313014320 its reverse (234103133103), we get a palindrome (3247416147423).
The spelling of 3013313014320 in words is "three trillion, thirteen billion, three hundred thirteen million, fourteen thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.290 sec. • engine limits •