Base | Representation |
---|---|
bin | 111100101100001110… |
… | …0111111000000100001 |
3 | 110110102010120000012122 |
4 | 1321120130333000201 |
5 | 4113410222341001 |
6 | 135512452434025 |
7 | 12262526215553 |
oct | 1713034770041 |
9 | 413363500178 |
10 | 130333012001 |
11 | 50301650a65 |
12 | 21314318915 |
13 | c3a0b9055a |
14 | 64457d34d3 |
15 | 35cc1e3b1b |
hex | 1e5873f021 |
130333012001 has 4 divisors (see below), whose sum is σ = 130335875604. Its totient is φ = 130330148400.
The previous prime is 130333011983. The next prime is 130333012037. The reversal of 130333012001 is 100210333031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 100210333031 = 135731 ⋅738301.
It can be written as a sum of positive squares in 2 ways, for example, as 93361413601 + 36971598400 = 305551^2 + 192280^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130333012001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130333011001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1362410 + ... + 1454931.
It is an arithmetic number, because the mean of its divisors is an integer number (32583968901).
Almost surely, 2130333012001 is an apocalyptic number.
It is an amenable number.
130333012001 is a deficient number, since it is larger than the sum of its proper divisors (2863603).
130333012001 is an equidigital number, since it uses as much as digits as its factorization.
130333012001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2863602.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 130333012001 its reverse (100210333031), we get a palindrome (230543345032).
The spelling of 130333012001 in words is "one hundred thirty billion, three hundred thirty-three million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •