Base | Representation |
---|---|
bin | 10110110010001001010110… |
… | …000000111100010011000001 |
3 | 111010210022112110021101222210 |
4 | 112302021112000330103001 |
5 | 101113211301201300413 |
6 | 553040345254252333 |
7 | 30051300332430411 |
oct | 2662112600742301 |
9 | 433708473241883 |
10 | 100203030103233 |
11 | 29a22959229822 |
12 | b2a40280570a9 |
13 | 43bb14a1595c5 |
14 | 1aa5bd14d4641 |
15 | b8b79dc823c3 |
hex | 5b225603c4c1 |
100203030103233 has 8 divisors (see below), whose sum is σ = 133604099647200. Its totient is φ = 66801990314048.
The previous prime is 100203030103207. The next prime is 100203030103247. The reversal of 100203030103233 is 332301030302001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100203030103233 - 210 = 100203030102209 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100203030103433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2205238 + ... + 14327216.
It is an arithmetic number, because the mean of its divisors is an integer number (16700512455900).
Almost surely, 2100203030103233 is an apocalyptic number.
It is an amenable number.
100203030103233 is a deficient number, since it is larger than the sum of its proper divisors (33401069543967).
100203030103233 is a wasteful number, since it uses less digits than its factorization.
100203030103233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14877391.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 100203030103233 its reverse (332301030302001), we get a palindrome (432504060405234).
The spelling of 100203030103233 in words is "one hundred trillion, two hundred three billion, thirty million, one hundred three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •