Base | Representation |
---|---|
bin | 101110101000011010… |
… | …0100110000011011001 |
3 | 100120110221110212120002 |
4 | 1131100310212003121 |
5 | 3120041343244231 |
6 | 114000452142345 |
7 | 10143365522063 |
oct | 1352064460331 |
9 | 316427425502 |
10 | 100140212441 |
11 | 395185a2855 |
12 | 174a89079b5 |
13 | 959b892699 |
14 | 4bbd91c733 |
15 | 29116d40cb |
hex | 1750d260d9 |
100140212441 has 8 divisors (see below), whose sum is σ = 100258329600. Its totient is φ = 100022151600.
The previous prime is 100140212413. The next prime is 100140212477. The reversal of 100140212441 is 144212041001.
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 100140212441 - 26 = 100140212377 is a prime.
It is a super-2 number, since 2×1001402124412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100140212041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4291955 + ... + 4315223.
It is an arithmetic number, because the mean of its divisors is an integer number (12532291200).
Almost surely, 2100140212441 is an apocalyptic number.
It is an amenable number.
100140212441 is a deficient number, since it is larger than the sum of its proper divisors (118117159).
100140212441 is a wasteful number, since it uses less digits than its factorization.
100140212441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28159.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 100140212441 its reverse (144212041001), we get a palindrome (244352253442).
The spelling of 100140212441 in words is "one hundred billion, one hundred forty million, two hundred twelve thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •