Base | Representation |
---|---|
bin | 111100101011111011… |
… | …1010000001111001101 |
3 | 110110101102221111110000 |
4 | 1321113313100033031 |
5 | 4113400204333401 |
6 | 135511500434513 |
7 | 12262346152245 |
oct | 1712767201715 |
9 | 413342844400 |
10 | 130323121101 |
11 | 502a7005868 |
12 | 21310b48a39 |
13 | c39bb09554 |
14 | 644437ab25 |
15 | 35cb3dd186 |
hex | 1e57dd03cd |
130323121101 has 10 divisors (see below), whose sum is σ = 194680218062. Its totient is φ = 86882080680.
The previous prime is 130323121073. The next prime is 130323121109. The reversal of 130323121101 is 101121323031.
130323121101 is a `hidden beast` number, since 130 + 323 + 1 + 211 + 0 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 123112563876 + 7210557225 = 350874^2 + 84915^2 .
It is not a de Polignac number, because 130323121101 - 215 = 130323088333 is a prime.
It is a super-2 number, since 2×1303231211012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130323121109) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 804463630 + ... + 804463791.
Almost surely, 2130323121101 is an apocalyptic number.
It is an amenable number.
130323121101 is a deficient number, since it is larger than the sum of its proper divisors (64357096961).
130323121101 is an equidigital number, since it uses as much as digits as its factorization.
130323121101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1608927433 (or 1608927424 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 130323121101 its reverse (101121323031), we get a palindrome (231444444132).
The spelling of 130323121101 in words is "one hundred thirty billion, three hundred twenty-three million, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •