Base | Representation |
---|---|
bin | 10100110111100111000… |
… | …011111100010110101100 |
3 | 12002002122221102211110000 |
4 | 110313213003330112230 |
5 | 141444014233230413 |
6 | 3014452230344300 |
7 | 205416231436335 |
oct | 24674703742654 |
9 | 5062587384400 |
10 | 1434100680108 |
11 | 5032204a0a48 |
12 | 1b1b314bb090 |
13 | a53097118b5 |
14 | 4d5a74d528c |
15 | 27486c9a073 |
hex | 14de70fc5ac |
1434100680108 has 60 divisors (see below), whose sum is σ = 3800378991640. Its totient is φ = 471485147328.
The previous prime is 1434100680107. The next prime is 1434100680113. The reversal of 1434100680108 is 8010860014341.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (1434100680107) by changing a digit.
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, 30293038 + ... + 30340341.
Almost surely, 21434100680108 is an apocalyptic number.
1434100680108 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1434100680108 is an abundant number, since it is smaller than the sum of its proper divisors (2366278311532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1434100680108 is a wasteful number, since it uses less digits than its factorization.
1434100680108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60633468 (or 60633457 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 36.
Adding to 1434100680108 its reverse (8010860014341), we get a palindrome (9444960694449).
The spelling of 1434100680108 in words is "one trillion, four hundred thirty-four billion, one hundred million, six hundred eighty thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •