Base | Representation |
---|---|
bin | 1101101101100010111000… |
… | …00001100110111110000000 |
3 | 10221202112010122211120122211 |
4 | 12312301130001212332000 |
5 | 12423003213332443202 |
6 | 144043422552511504 |
7 | 6231265660066450 |
oct | 666613401467600 |
9 | 127675118746584 |
10 | 30152214343552 |
11 | 9675533a262a4 |
12 | 346b84b6ab594 |
13 | 13a94596a2962 |
14 | 763536c6dd60 |
15 | 3744dceaa1d7 |
hex | 1b6c5c066f80 |
30152214343552 has 128 divisors (see below), whose sum is σ = 74105090265600. Its totient is φ = 11934309488640.
The previous prime is 30152214343499. The next prime is 30152214343591. The reversal of 30152214343552 is 25534341225103.
It is a tau number, because it is divible by the number of its divisors (128).
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, 24628774 + ... + 25824037.
It is an arithmetic number, because the mean of its divisors is an integer number (578946017700).
Almost surely, 230152214343552 is an apocalyptic number.
30152214343552 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
30152214343552 is an abundant number, since it is smaller than the sum of its proper divisors (43952875922048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30152214343552 is a wasteful number, since it uses less digits than its factorization.
30152214343552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50452884 (or 50452872 counting only the distinct ones).
The product of its (nonzero) digits is 432000, while the sum is 40.
Adding to 30152214343552 its reverse (25534341225103), we get a palindrome (55686555568655).
The spelling of 30152214343552 in words is "thirty trillion, one hundred fifty-two billion, two hundred fourteen million, three hundred forty-three thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •