Base | Representation |
---|---|
bin | 10111001110001100010000… |
… | …100001000110110011101000 |
3 | 111101121120011111222001211020 |
4 | 113032030100201012303220 |
5 | 101341300330414230142 |
6 | 1001114003020132440 |
7 | 30340446103151346 |
oct | 2716142041066350 |
9 | 441546144861736 |
10 | 102130304445672 |
11 | 2a5a6245367688 |
12 | b555654397120 |
13 | 44cab006782b9 |
14 | 1b311c137a996 |
15 | bc199c1ebcec |
hex | 5ce310846ce8 |
102130304445672 has 128 divisors (see below), whose sum is σ = 258271109107200. Its totient is φ = 33652446507008.
The previous prime is 102130304445599. The next prime is 102130304445677. The reversal of 102130304445672 is 276544403031201.
It is not an unprimeable number, because it can be changed into a prime (102130304445677) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1554059758 + ... + 1554125474.
It is an arithmetic number, because the mean of its divisors is an integer number (2017743039900).
Almost surely, 2102130304445672 is an apocalyptic number.
102130304445672 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102130304445672 is an abundant number, since it is smaller than the sum of its proper divisors (156140804661528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102130304445672 is a wasteful number, since it uses less digits than its factorization.
102130304445672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67355 (or 67351 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 42.
Adding to 102130304445672 its reverse (276544403031201), we get a palindrome (378674707476873).
The spelling of 102130304445672 in words is "one hundred two trillion, one hundred thirty billion, three hundred four million, four hundred forty-five thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •