Base | Representation |
---|---|
bin | 101110100101001101… |
… | …1100111101011110110 |
3 | 100120012110202000210112 |
4 | 1131022123213223312 |
5 | 3114331422032410 |
6 | 113542102223022 |
7 | 10140624326630 |
oct | 1351233475366 |
9 | 316173660715 |
10 | 100033002230 |
11 | 39473027177 |
12 | 17478a24a72 |
13 | 95825c60a5 |
14 | 4bad5b1a50 |
15 | 29070a8105 |
hex | 174a6e7af6 |
100033002230 has 32 divisors (see below), whose sum is σ = 212878117440. Its totient is φ = 33114372480.
The previous prime is 100033002137. The next prime is 100033002253. The reversal of 100033002230 is 32200330001.
It is a super-3 number, since 3×1000330022303 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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, 24636641 + ... + 24640700.
It is an arithmetic number, because the mean of its divisors is an integer number (6652441170).
Almost surely, 2100033002230 is an apocalyptic number.
100033002230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100033002230 is an abundant number, since it is smaller than the sum of its proper divisors (112845115210).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100033002230 is a wasteful number, since it uses less digits than its factorization.
100033002230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49277384.
The product of its (nonzero) digits is 108, while the sum is 14.
Adding to 100033002230 its reverse (32200330001), we get a palindrome (132233332231).
The spelling of 100033002230 in words is "one hundred billion, thirty-three million, two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •