Base | Representation |
---|---|
bin | 10100101000011110101… |
… | …111100000111111100110 |
3 | 12000112201202021202120000 |
4 | 110220132233200333212 |
5 | 141212231333330240 |
6 | 3003204212522130 |
7 | 204302524323354 |
oct | 24503657407746 |
9 | 5015652252500 |
10 | 1417854980070 |
11 | 4a734419a071 |
12 | 1aa958920346 |
13 | a391aa90239 |
14 | 4c8a5a867d4 |
15 | 26d3591e430 |
hex | 14a1ebe0fe6 |
1417854980070 has 40 divisors (see below), whose sum is σ = 3812454504144. Its totient is φ = 378094661136.
The previous prime is 1417854979991. The next prime is 1417854980081. The reversal of 1417854980070 is 700894587141.
1417854980070 is a `hidden beast` number, since 1 + 4 + 1 + 7 + 85 + 498 + 0 + 0 + 70 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 1417854979989 and 1417854980016.
It is a congruent number.
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 19 ways as a sum of consecutive naturals, for example, 875218314 + ... + 875219933.
Almost surely, 21417854980070 is an apocalyptic number.
1417854980070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1417854980070 is an abundant number, since it is smaller than the sum of its proper divisors (2394599524074).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1417854980070 is a wasteful number, since it uses less digits than its factorization.
1417854980070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1750438266 (or 1750438257 counting only the distinct ones).
The product of its (nonzero) digits is 2257920, while the sum is 54.
The spelling of 1417854980070 in words is "one trillion, four hundred seventeen billion, eight hundred fifty-four million, nine hundred eighty thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •