Base | Representation |
---|---|
bin | 11101100111001011010011… |
… | …111000110101011111011111 |
3 | 122002010101201121222202020222 |
4 | 131213023103320311133133 |
5 | 114032234403112203210 |
6 | 1140553215345231555 |
7 | 36301131263212463 |
oct | 3547132370653737 |
9 | 562111647882228 |
10 | 130235553241055 |
11 | 38551651630679 |
12 | 127346333325bb |
13 | 57892106017b2 |
14 | 24236120404a3 |
15 | 100cad3e31655 |
hex | 7672d3e357df |
130235553241055 has 16 divisors (see below), whose sum is σ = 158466329541504. Its totient is φ = 102733436793600.
The previous prime is 130235553241049. The next prime is 130235553241063. The reversal of 130235553241055 is 550142355532031.
It is not a de Polignac number, because 130235553241055 - 28 = 130235553240799 is a prime.
It is a super-2 number, since 2×1302355532410552 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130235553240997 and 130235553241015.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 46853639 + ... + 49555368.
It is an arithmetic number, because the mean of its divisors is an integer number (9904145596344).
Almost surely, 2130235553241055 is an apocalyptic number.
130235553241055 is a deficient number, since it is larger than the sum of its proper divisors (28230776300449).
130235553241055 is an equidigital number, since it uses as much as digits as its factorization.
130235553241055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96412786.
The product of its (nonzero) digits is 1350000, while the sum is 44.
The spelling of 130235553241055 in words is "one hundred thirty trillion, two hundred thirty-five billion, five hundred fifty-three million, two hundred forty-one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •