Base | Representation |
---|---|
bin | 1101111111001111101110… |
… | …00001011000111101111100 |
3 | 11000220122222112010101021010 |
4 | 12333213313001120331330 |
5 | 13012434302204042140 |
6 | 145231045100235220 |
7 | 6323236341433461 |
oct | 677476701307574 |
9 | 130818875111233 |
10 | 30760405143420 |
11 | 988a461865a87 |
12 | 35496a553bb10 |
13 | 1421903258ab4 |
14 | 784b50c87668 |
15 | 385236e61880 |
hex | 1bf9f7058f7c |
30760405143420 has 48 divisors (see below), whose sum is σ = 86233281015168. Its totient is φ = 8192855979840.
The previous prime is 30760405143343. The next prime is 30760405143427. The reversal of 30760405143420 is 2434150406703.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30760405143427) 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 15 ways as a sum of consecutive naturals, for example, 309910126 + ... + 310009365.
It is an arithmetic number, because the mean of its divisors is an integer number (1796526687816).
Almost surely, 230760405143420 is an apocalyptic number.
30760405143420 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
30760405143420 is an abundant number, since it is smaller than the sum of its proper divisors (55472875871748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30760405143420 is a wasteful number, since it uses less digits than its factorization.
30760405143420 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 619920330 (or 619920328 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 39.
The spelling of 30760405143420 in words is "thirty trillion, seven hundred sixty billion, four hundred five million, one hundred forty-three thousand, four hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •