Base | Representation |
---|---|
bin | 101111000010111111… |
… | …0111100111011100001 |
3 | 100122210002202110202121 |
4 | 1132011332330323201 |
5 | 3123403210320113 |
6 | 114225152544241 |
7 | 10204445564545 |
oct | 1360576747341 |
9 | 318702673677 |
10 | 101032120033 |
11 | 39935aa8169 |
12 | 176b7552081 |
13 | 96b15b4860 |
14 | 4c6616da25 |
15 | 2964b62e8d |
hex | 1785fbcee1 |
101032120033 has 16 divisors (see below), whose sum is σ = 113611478400. Its totient is φ = 89145074304.
The previous prime is 101032120031. The next prime is 101032120037. The reversal of 101032120033 is 330021230101.
It is not a de Polignac number, because 101032120033 - 21 = 101032120031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101032119989 and 101032120016.
It is not an unprimeable number, because it can be changed into a prime (101032120031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 329493 + ... + 557341.
It is an arithmetic number, because the mean of its divisors is an integer number (7100717400).
Almost surely, 2101032120033 is an apocalyptic number.
101032120033 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
101032120033 is a deficient number, since it is larger than the sum of its proper divisors (12579358367).
101032120033 is a wasteful number, since it uses less digits than its factorization.
101032120033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229368.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 101032120033 its reverse (330021230101), we get a palindrome (431053350134).
The spelling of 101032120033 in words is "one hundred one billion, thirty-two million, one hundred twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •