Base | Representation |
---|---|
bin | 10110110101000001001011… |
… | …011101000001101001101011 |
3 | 111011111012000222211211002110 |
4 | 112311001023131001221223 |
5 | 101124430030340131220 |
6 | 553311152235133403 |
7 | 30101456016033105 |
oct | 2665011335015153 |
9 | 434435028754073 |
10 | 100400421411435 |
11 | 29a996414a9192 |
12 | b316335ba4263 |
13 | 4403946b81562 |
14 | 1ab1598d50575 |
15 | b919a31aabe0 |
hex | 5b504b741a6b |
100400421411435 has 48 divisors (see below), whose sum is σ = 169552782360864. Its totient is φ = 50724939377664.
The previous prime is 100400421411427. The next prime is 100400421411461. The reversal of 100400421411435 is 534114124004001.
It is not a de Polignac number, because 100400421411435 - 23 = 100400421411427 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 74454049 + ... + 75790541.
It is an arithmetic number, because the mean of its divisors is an integer number (3532349632518).
Almost surely, 2100400421411435 is an apocalyptic number.
100400421411435 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
100400421411435 is a deficient number, since it is larger than the sum of its proper divisors (69152360949429).
100400421411435 is a wasteful number, since it uses less digits than its factorization.
100400421411435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1350412 (or 1350393 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 30.
Adding to 100400421411435 its reverse (534114124004001), we get a palindrome (634514545415436).
The spelling of 100400421411435 in words is "one hundred trillion, four hundred billion, four hundred twenty-one million, four hundred eleven thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •