Base | Representation |
---|---|
bin | 1000101111000001000… |
… | …10111110110110011100 |
3 | 1001200122212202011201010 |
4 | 10113200202332312130 |
5 | 14404121210311030 |
6 | 345512341215220 |
7 | 30453152665206 |
oct | 4274042766634 |
9 | 1050585664633 |
10 | 300120010140 |
11 | 106309a15735 |
12 | 4a1b9701510 |
13 | 223bb95a322 |
14 | 10751061776 |
15 | 7c17eb76b0 |
hex | 45e08bed9c |
300120010140 has 48 divisors (see below), whose sum is σ = 843852119040. Its totient is φ = 79697136960.
The previous prime is 300120010123. The next prime is 300120010159. The reversal of 300120010140 is 41010021003.
It is a happy number.
300120010140 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10450096 + ... + 10478775.
It is an arithmetic number, because the mean of its divisors is an integer number (17580252480).
Almost surely, 2300120010140 is an apocalyptic number.
300120010140 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
300120010140 is an abundant number, since it is smaller than the sum of its proper divisors (543732108900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
300120010140 is a wasteful number, since it uses less digits than its factorization.
300120010140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20929122 (or 20929120 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 300120010140 its reverse (41010021003), we get a palindrome (341130031143).
The spelling of 300120010140 in words is "three hundred billion, one hundred twenty million, ten thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •