Base | Representation |
---|---|
bin | 10110101111101011000001… |
… | …011001111101100001100011 |
3 | 111010012001202001222111201220 |
4 | 112233223001121331201203 |
5 | 101102420122440212011 |
6 | 552430312505230123 |
7 | 30033101546136021 |
oct | 2657530131754143 |
9 | 433161661874656 |
10 | 100033033132131 |
11 | 29967853390280 |
12 | b2770a4492343 |
13 | 43a80c7a23088 |
14 | 1a9b8a6009711 |
15 | b8714e834506 |
hex | 5afac167d863 |
100033033132131 has 16 divisors (see below), whose sum is σ = 145510062764160. Its totient is φ = 60622968553920.
The previous prime is 100033033132129. The next prime is 100033033132169. The reversal of 100033033132131 is 131231330330001.
It is not a de Polignac number, because 100033033132131 - 21 = 100033033132129 is a prime.
It is a super-2 number, since 2×1000330331321312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100033033130131) 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, 77150626 + ... + 78436503.
It is an arithmetic number, because the mean of its divisors is an integer number (9094378922760).
Almost surely, 2100033033132131 is an apocalyptic number.
100033033132131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100033033132131 is a deficient number, since it is larger than the sum of its proper divisors (45477029632029).
100033033132131 is a wasteful number, since it uses less digits than its factorization.
100033033132131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 155606626.
The product of its (nonzero) digits is 1458, while the sum is 24.
Adding to 100033033132131 its reverse (131231330330001), we get a palindrome (231264363462132).
The spelling of 100033033132131 in words is "one hundred trillion, thirty-three billion, thirty-three million, one hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •