Base | Representation |
---|---|
bin | 11110010010011111101001… |
… | …101111000001000110000111 |
3 | 122110122222022110120221101201 |
4 | 132102133221233001012013 |
5 | 114430022324004231043 |
6 | 1151152522303203331 |
7 | 40026162526101016 |
oct | 3622375157010607 |
9 | 573588273527351 |
10 | 133212332102023 |
11 | 3949a03a6a6959 |
12 | 12b355385a6547 |
13 | 5943b3b2c6535 |
14 | 24c7722d22a7d |
15 | 1060259c32c4d |
hex | 7927e9bc1187 |
133212332102023 has 16 divisors (see below), whose sum is σ = 137109922110720. Its totient is φ = 129385015360704.
The previous prime is 133212332102011. The next prime is 133212332102099. The reversal of 133212332102023 is 320201233212331.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 133212332102023 - 229 = 133211795231111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133212332101982 and 133212332102000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133212332132023) 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, 48142261 + ... + 50834062.
It is an arithmetic number, because the mean of its divisors is an integer number (8569370131920).
Almost surely, 2133212332102023 is an apocalyptic number.
133212332102023 is a deficient number, since it is larger than the sum of its proper divisors (3897590008697).
133212332102023 is a wasteful number, since it uses less digits than its factorization.
133212332102023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98976678.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 133212332102023 its reverse (320201233212331), we get a palindrome (453413565314354).
The spelling of 133212332102023 in words is "one hundred thirty-three trillion, two hundred twelve billion, three hundred thirty-two million, one hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •