Base | Representation |
---|---|
bin | 10110110010100010011110… |
… | …101111010110100111110011 |
3 | 111010212220012102120220021121 |
4 | 112302202132233112213303 |
5 | 101114132040112024021 |
6 | 553101011402203111 |
7 | 30053244222152341 |
oct | 2662423657264763 |
9 | 433786172526247 |
10 | 100230020033011 |
11 | 29a33349354510 |
12 | b2a92baab3497 |
13 | 43c085ba2265b |
14 | 1aa7231c74991 |
15 | b8c32d4c8741 |
hex | 5b289ebd69f3 |
100230020033011 has 16 divisors (see below), whose sum is σ = 114105522850560. Its totient is φ = 87149137252320.
The previous prime is 100230020032979. The next prime is 100230020033021. The reversal of 100230020033011 is 110330020032001.
It is not a de Polignac number, because 100230020033011 - 25 = 100230020032979 is a prime.
It is a super-2 number, since 2×1002300200330112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100230020033021) 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, 13836540 + ... + 19796713.
It is an arithmetic number, because the mean of its divisors is an integer number (7131595178160).
Almost surely, 2100230020033011 is an apocalyptic number.
100230020033011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100230020033011 is a deficient number, since it is larger than the sum of its proper divisors (13875502817549).
100230020033011 is a wasteful number, since it uses less digits than its factorization.
100230020033011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33645066.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 100230020033011 its reverse (110330020032001), we get a palindrome (210560040065012).
The spelling of 100230020033011 in words is "one hundred trillion, two hundred thirty billion, twenty million, thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •