Base | Representation |
---|---|
bin | 101110110000010011… |
… | …1101000100101111111 |
3 | 100121011102012012022221 |
4 | 1131200213220211333 |
5 | 3121112221003211 |
6 | 114043040550211 |
7 | 10153064355433 |
oct | 1354047504577 |
9 | 317142165287 |
10 | 100405250431 |
11 | 39644167812 |
12 | 17561622367 |
13 | 961176bab5 |
14 | 4c06bd09c3 |
15 | 2929ad8c71 |
hex | 17609e897f |
100405250431 has 6 divisors (see below), whose sum is σ = 100733463240. Its totient is φ = 100078103556.
The previous prime is 100405250357. The next prime is 100405250441. The reversal of 100405250431 is 134052504001.
It is a happy number.
It is not a de Polignac number, because 100405250431 - 225 = 100371695999 is a prime.
It is a super-2 number, since 2×1004052504312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100405250396 and 100405250405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100405250441) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 438411 + ... + 626908.
It is an arithmetic number, because the mean of its divisors is an integer number (16788910540).
Almost surely, 2100405250431 is an apocalyptic number.
100405250431 is a deficient number, since it is larger than the sum of its proper divisors (328212809).
100405250431 is an frugal number, since it uses more digits than its factorization.
100405250431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1065933 (or 1065626 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 100405250431 its reverse (134052504001), we get a palindrome (234457754432).
The spelling of 100405250431 in words is "one hundred billion, four hundred five million, two hundred fifty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •