Base | Representation |
---|---|
bin | 10110101111010101101010… |
… | …011111000000100101010110 |
3 | 111010002212112211020202010220 |
4 | 112233111222133000211112 |
5 | 101102031141100013420 |
6 | 552412001120455210 |
7 | 30031330336552515 |
oct | 2657255237004526 |
9 | 433085484222126 |
10 | 100010100001110 |
11 | 29959055213532 |
12 | b27276417a506 |
13 | 43a5bb1777570 |
14 | 1a9a72c36667c |
15 | b8675b332840 |
hex | 5af56a7c0956 |
100010100001110 has 128 divisors (see below), whose sum is σ = 258731525445120. Its totient is φ = 24594650843136.
The previous prime is 100010100001109. The next prime is 100010100001129. The reversal of 100010100001110 is 11100001010001.
100010100001110 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3577780894 + ... + 3577808846.
It is an arithmetic number, because the mean of its divisors is an integer number (2021340042540).
Almost surely, 2100010100001110 is an apocalyptic number.
100010100001110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100010100001110 is an abundant number, since it is smaller than the sum of its proper divisors (158721425444010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100010100001110 is a wasteful number, since it uses less digits than its factorization.
100010100001110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36302.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 100010100001110 its reverse (11100001010001), we get a palindrome (111110101011111).
The spelling of 100010100001110 in words is "one hundred trillion, ten billion, one hundred million, one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.925 sec. • engine limits •