Base | Representation |
---|---|
bin | 10110111000001001011010… |
… | …100011110001001111000000 |
3 | 111012020201222211122102210112 |
4 | 112320021122203301033000 |
5 | 101141440341314432430 |
6 | 553554030505450452 |
7 | 30123136661065412 |
oct | 2670113243611700 |
9 | 435221884572715 |
10 | 100615423202240 |
11 | 2a0718413a4901 |
12 | b34bb397a0a28 |
13 | 441acbc1c590b |
14 | 1abbb535a09b2 |
15 | b9738869a195 |
hex | 5b825a8f13c0 |
100615423202240 has 56 divisors (see below), whose sum is σ = 239594299903152. Its totient is φ = 40245527029760.
The previous prime is 100615423202237. The next prime is 100615423202263. The reversal of 100615423202240 is 42202324516001.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a junction number, because it is equal to n+sod(n) for n = 100615423202197 and 100615423202206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17832380 + ... + 22786500.
Almost surely, 2100615423202240 is an apocalyptic number.
100615423202240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100615423202240 is an abundant number, since it is smaller than the sum of its proper divisors (138978876700912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100615423202240 is an equidigital number, since it uses as much as digits as its factorization.
100615423202240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5017605 (or 5017595 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 32.
Adding to 100615423202240 its reverse (42202324516001), we get a palindrome (142817747718241).
The spelling of 100615423202240 in words is "one hundred trillion, six hundred fifteen billion, four hundred twenty-three million, two hundred two thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •