Base | Representation |
---|---|
bin | 11101100101011111111010… |
… | …001001011100001110100000 |
3 | 122001201101001121212111002211 |
4 | 131211133322021130032200 |
5 | 114023342213114324412 |
6 | 1140424224153451504 |
7 | 36256606424351140 |
oct | 3545377211341640 |
9 | 561641047774084 |
10 | 130120231011232 |
11 | 385077531a6520 |
12 | 1271620a110b94 |
13 | 577b392593b97 |
14 | 241bbd207a920 |
15 | 1009ad4981ca7 |
hex | 7657fa25c3a0 |
130120231011232 has 48 divisors (see below), whose sum is σ = 319386021579072. Its totient is φ = 50696193899520.
The previous prime is 130120231011217. The next prime is 130120231011247. The reversal of 130120231011232 is 232110132021031.
It is an interprime number because it is at equal distance from previous prime (130120231011217) and next prime (130120231011247).
It is a Harshad number since it is a multiple of its sum of digits (22).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26404265193 + ... + 26404270120.
It is an arithmetic number, because the mean of its divisors is an integer number (6653875449564).
Almost surely, 2130120231011232 is an apocalyptic number.
It is an amenable number.
130120231011232 is an abundant number, since it is smaller than the sum of its proper divisors (189265790567840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130120231011232 is a wasteful number, since it uses less digits than its factorization.
130120231011232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52808535341 (or 52808535333 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 130120231011232 its reverse (232110132021031), we get a palindrome (362230363032263).
The spelling of 130120231011232 in words is "one hundred thirty trillion, one hundred twenty billion, two hundred thirty-one million, eleven thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •