Base | Representation |
---|---|
bin | 11110010101001111011110… |
… | …111110101100000111001111 |
3 | 122111100000122010120011100222 |
4 | 132111033132332230013033 |
5 | 114441121003314101111 |
6 | 1151415344434141555 |
7 | 40045625236454540 |
oct | 3625173676540717 |
9 | 574300563504328 |
10 | 133401130222031 |
11 | 395621132828a1 |
12 | 12b660487218bb |
13 | 5958898926149 |
14 | 24d29133c24c7 |
15 | 1065109a3b7db |
hex | 7953defac1cf |
133401130222031 has 16 divisors (see below), whose sum is σ = 160493128032000. Its totient is φ = 108318598187328.
The previous prime is 133401130222013. The next prime is 133401130222051. The reversal of 133401130222031 is 130222031104331.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 133401130222031 - 246 = 63032386044367 is a prime.
It is a super-2 number, since 2×1334011302220312 (a number of 29 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 (133401130222051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30988481 + ... + 35029818.
It is an arithmetic number, because the mean of its divisors is an integer number (10030820502000).
Almost surely, 2133401130222031 is an apocalyptic number.
133401130222031 is a deficient number, since it is larger than the sum of its proper divisors (27091997809969).
133401130222031 is a wasteful number, since it uses less digits than its factorization.
133401130222031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66033518.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 133401130222031 its reverse (130222031104331), we get a palindrome (263623161326362).
The spelling of 133401130222031 in words is "one hundred thirty-three trillion, four hundred one billion, one hundred thirty million, two hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •