Base | Representation |
---|---|
bin | 111100101111011011… |
… | …0101101111111010101 |
3 | 110110200121122222010001 |
4 | 1321132312231333111 |
5 | 4114120221440313 |
6 | 135531250531301 |
7 | 12265302200365 |
oct | 1713666557725 |
9 | 413617588101 |
10 | 130440421333 |
11 | 50357243202 |
12 | 21344296b31 |
13 | c3ba1c9681 |
14 | 6455b929a5 |
15 | 35d685dadd |
hex | 1e5edadfd5 |
130440421333 has 2 divisors, whose sum is σ = 130440421334. Its totient is φ = 130440421332.
The previous prime is 130440421273. The next prime is 130440421367. The reversal of 130440421333 is 333124044031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99034201809 + 31406219524 = 314697^2 + 177218^2 .
It is an emirp because it is prime and its reverse (333124044031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130440421333 - 29 = 130440420821 is a prime.
It is a super-2 number, since 2×1304404213332 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130440421373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65220210666 + 65220210667.
It is an arithmetic number, because the mean of its divisors is an integer number (65220210667).
Almost surely, 2130440421333 is an apocalyptic number.
It is an amenable number.
130440421333 is a deficient number, since it is larger than the sum of its proper divisors (1).
130440421333 is an equidigital number, since it uses as much as digits as its factorization.
130440421333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 130440421333 its reverse (333124044031), we get a palindrome (463564465364).
The spelling of 130440421333 in words is "one hundred thirty billion, four hundred forty million, four hundred twenty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •