Base | Representation |
---|---|
bin | 111100100110010001… |
… | …0011011100110000111 |
3 | 110102220012102002122012 |
4 | 1321030202123212013 |
5 | 4113003034110343 |
6 | 135440552124435 |
7 | 12254551132361 |
oct | 1711442334607 |
9 | 412805362565 |
10 | 130133113223 |
11 | 50209828063 |
12 | 2127939671b |
13 | c36b640359 |
14 | 6427039d31 |
15 | 35b98a9718 |
hex | 1e4c89b987 |
130133113223 has 8 divisors (see below), whose sum is σ = 131311596768. Its totient is φ = 128955101184.
The previous prime is 130133113181. The next prime is 130133113249. The reversal of 130133113223 is 322311331031.
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 130133113223 - 226 = 130066004359 is a prime.
It is a super-2 number, since 2×1301331132232 (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 (130133113273) 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, 448886 + ... + 679532.
It is an arithmetic number, because the mean of its divisors is an integer number (16413949596).
Almost surely, 2130133113223 is an apocalyptic number.
130133113223 is a deficient number, since it is larger than the sum of its proper divisors (1178483545).
130133113223 is a wasteful number, since it uses less digits than its factorization.
130133113223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235753.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 130133113223 its reverse (322311331031), we get a palindrome (452444444254).
The spelling of 130133113223 in words is "one hundred thirty billion, one hundred thirty-three million, one hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •