Base | Representation |
---|---|
bin | 111101111110110000… |
… | …1011100110111101011 |
3 | 110201120010200200122001 |
4 | 1323331201130313223 |
5 | 4140043210023111 |
6 | 141051342511431 |
7 | 12421254634630 |
oct | 1737541346753 |
9 | 421503620561 |
10 | 133102423531 |
11 | 514a2936920 |
12 | 21967895577 |
13 | c72286a9bc |
14 | 6629534187 |
15 | 36e03da1c1 |
hex | 1efd85cdeb |
133102423531 has 32 divisors (see below), whose sum is σ = 168094757376. Its totient is φ = 102375360000.
The previous prime is 133102423483. The next prime is 133102423537. The reversal of 133102423531 is 135324201331.
It is a cyclic number.
It is not a de Polignac number, because 133102423531 - 27 = 133102423403 is a prime.
It is a super-2 number, since 2×1331024235312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 133102423531.
It is not an unprimeable number, because it can be changed into a prime (133102423537) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7666921 + ... + 7684261.
It is an arithmetic number, because the mean of its divisors is an integer number (5252961168).
Almost surely, 2133102423531 is an apocalyptic number.
133102423531 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
133102423531 is a deficient number, since it is larger than the sum of its proper divisors (34992333845).
133102423531 is a wasteful number, since it uses less digits than its factorization.
133102423531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18643.
The product of its (nonzero) digits is 6480, while the sum is 28.
Adding to 133102423531 its reverse (135324201331), we get a palindrome (268426624862).
The spelling of 133102423531 in words is "one hundred thirty-three billion, one hundred two million, four hundred twenty-three thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •