Base | Representation |
---|---|
bin | 1001010111100111000100… |
… | …1011001000110101101000 |
3 | 1100110210021110020001200221 |
4 | 2111321301023020311220 |
5 | 2322233404430233000 |
6 | 33524153032135424 |
7 | 2112145043001433 |
oct | 225716113106550 |
9 | 40423243201627 |
10 | 10301230321000 |
11 | 33117aaa66733 |
12 | 11a4545237574 |
13 | 59952bb36708 |
14 | 27882181481a |
15 | 12ce5a62b61a |
hex | 95e712c8d68 |
10301230321000 has 64 divisors (see below), whose sum is σ = 24444384456960. Its totient is φ = 4062457000000.
The previous prime is 10301230320977. The next prime is 10301230321003. The reversal of 10301230321000 is 12303210301.
It is a super-2 number, since 2×103012303210002 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10301230321003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 72472876 + ... + 72614875.
It is an arithmetic number, because the mean of its divisors is an integer number (381943507140).
Almost surely, 210301230321000 is an apocalyptic number.
10301230321000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10301230321000 is an abundant number, since it is smaller than the sum of its proper divisors (14143154135960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10301230321000 is a wasteful number, since it uses less digits than its factorization.
10301230321000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145087843 (or 145087829 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 10301230321000 its reverse (12303210301), we get a palindrome (10313533531301).
The spelling of 10301230321000 in words is "ten trillion, three hundred one billion, two hundred thirty million, three hundred twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •