Base | Representation |
---|---|
bin | 10110111110100010111101… |
… | …001100001010100111110110 |
3 | 111020210210001011201011201220 |
4 | 112332202331030022213312 |
5 | 101221141434120421400 |
6 | 554532033550331210 |
7 | 30166665120355050 |
oct | 2676427514124766 |
9 | 436723034634656 |
10 | 101055164623350 |
11 | 2a221288a22083 |
12 | b4012021b9b06 |
13 | 44505cc15c042 |
14 | 1ad514b8608d0 |
15 | ba3a23eee7a0 |
hex | 5be8bd30a9f6 |
101055164623350 has 96 divisors (see below), whose sum is σ = 286687144538880. Its totient is φ = 23076715674240.
The previous prime is 101055164623339. The next prime is 101055164623351. The reversal of 101055164623350 is 53326461550101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101055164623351) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 43892992 + ... + 46137891.
It is an arithmetic number, because the mean of its divisors is an integer number (2986324422280).
Almost surely, 2101055164623350 is an apocalyptic number.
101055164623350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101055164623350 is an abundant number, since it is smaller than the sum of its proper divisors (185631979915530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101055164623350 is a wasteful number, since it uses less digits than its factorization.
101055164623350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90031974 (or 90031969 counting only the distinct ones).
The product of its (nonzero) digits is 324000, while the sum is 42.
The spelling of 101055164623350 in words is "one hundred one trillion, fifty-five billion, one hundred sixty-four million, six hundred twenty-three thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •