Base | Representation |
---|---|
bin | 111100100101010100… |
… | …1101001101010101001 |
3 | 110102210222211111211022 |
4 | 1321022221221222221 |
5 | 4112421432421213 |
6 | 135433501342225 |
7 | 12254015043062 |
oct | 1711251515251 |
9 | 412728744738 |
10 | 130101451433 |
11 | 501a2972098 |
12 | 2126a867975 |
13 | c364c05b75 |
14 | 6422b57569 |
15 | 35b6c03308 |
hex | 1e4aa69aa9 |
130101451433 has 8 divisors (see below), whose sum is σ = 130213855200. Its totient is φ = 129989099808.
The previous prime is 130101451427. The next prime is 130101451471. The reversal of 130101451433 is 334154101031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130101451433 - 230 = 129027709609 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130101451033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6179198 + ... + 6200216.
It is an arithmetic number, because the mean of its divisors is an integer number (16276731900).
Almost surely, 2130101451433 is an apocalyptic number.
It is an amenable number.
130101451433 is a deficient number, since it is larger than the sum of its proper divisors (112403767).
130101451433 is a wasteful number, since it uses less digits than its factorization.
130101451433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26071.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 130101451433 its reverse (334154101031), we get a palindrome (464255552464).
The spelling of 130101451433 in words is "one hundred thirty billion, one hundred one million, four hundred fifty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •