Base | Representation |
---|---|
bin | 10110111101111001011101… |
… | …010000100111110110011110 |
3 | 111020122112000202212110220102 |
4 | 112331321131100213312132 |
5 | 101214424210002142300 |
6 | 554455344230021102 |
7 | 30163526653203560 |
oct | 2675713520476636 |
9 | 436575022773812 |
10 | 101010605505950 |
11 | 2a2043a2515718 |
12 | b3b46474a7792 |
13 | 444934a6a499a |
14 | 1ad2d21999330 |
15 | ba27b714d0d5 |
hex | 5bde5d427d9e |
101010605505950 has 48 divisors (see below), whose sum is σ = 215478414153600. Its totient is φ = 34509832276320.
The previous prime is 101010605505923. The next prime is 101010605505959. The reversal of 101010605505950 is 59505506010101.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101010605505959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 509798000 + ... + 509996099.
It is an arithmetic number, because the mean of its divisors is an integer number (4489133628200).
Almost surely, 2101010605505950 is an apocalyptic number.
101010605505950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101010605505950 is an abundant number, since it is smaller than the sum of its proper divisors (114467808647650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101010605505950 is a wasteful number, since it uses less digits than its factorization.
101010605505950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1019794401 (or 1019794396 counting only the distinct ones).
The product of its (nonzero) digits is 33750, while the sum is 38.
The spelling of 101010605505950 in words is "one hundred one trillion, ten billion, six hundred five million, five hundred five thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •