Base | Representation |
---|---|
bin | 101111000010011001… |
… | …0001101011000011010 |
3 | 100122201200220101110111 |
4 | 1132010302031120122 |
5 | 3123333033033310 |
6 | 114223153434534 |
7 | 10204112565421 |
oct | 1360462153032 |
9 | 318650811414 |
10 | 101012002330 |
11 | 39925707468 |
12 | 176b086ba4a |
13 | 96aa38c9a5 |
14 | 4c636142b8 |
15 | 2962edc28a |
hex | 1784c8d61a |
101012002330 has 32 divisors (see below), whose sum is σ = 192587814864. Its totient is φ = 38014058496.
The previous prime is 101012002327. The next prime is 101012002369. The reversal of 101012002330 is 33200210101.
It can be written as a sum of positive squares in 8 ways, for example, as 90713608969 + 10298393361 = 301187^2 + 101481^2 .
It is a super-2 number, since 2×1010120023302 (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 101012002330.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 360094 + ... + 575926.
Almost surely, 2101012002330 is an apocalyptic number.
101012002330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101012002330 is a deficient number, since it is larger than the sum of its proper divisors (91575812534).
101012002330 is a wasteful number, since it uses less digits than its factorization.
101012002330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218610.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 101012002330 its reverse (33200210101), we get a palindrome (134212212431).
The spelling of 101012002330 in words is "one hundred one billion, twelve million, two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •