Base | Representation |
---|---|
bin | 10110111000100001111000… |
… | …111100000111110010001010 |
3 | 111012100020211022011120020020 |
4 | 112320201320330013302022 |
5 | 101142403201343100224 |
6 | 554014054314441310 |
7 | 30125060133144360 |
oct | 2670417074076212 |
9 | 435306738146206 |
10 | 100641702706314 |
11 | 2a0819a74aa210 |
12 | b355052733236 |
13 | 442061983c023 |
14 | 1abd127851630 |
15 | b97dc585ec79 |
hex | 5b8878f07c8a |
100641702706314 has 64 divisors (see below), whose sum is σ = 251011374750720. Its totient is φ = 26134385800320.
The previous prime is 100641702706291. The next prime is 100641702706319. The reversal of 100641702706314 is 413607207146001.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (100641702706319) 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 31 ways as a sum of consecutive naturals, for example, 24403219 + ... + 28227654.
It is an arithmetic number, because the mean of its divisors is an integer number (3922052730480).
Almost surely, 2100641702706314 is an apocalyptic number.
100641702706314 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
100641702706314 is an abundant number, since it is smaller than the sum of its proper divisors (150369672044406).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100641702706314 is a wasteful number, since it uses less digits than its factorization.
100641702706314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52635035.
The product of its (nonzero) digits is 169344, while the sum is 42.
The spelling of 100641702706314 in words is "one hundred trillion, six hundred forty-one billion, seven hundred two million, seven hundred six thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •