Base | Representation |
---|---|
bin | 10111000000101011110011… |
… | …001110001100000001011011 |
3 | 111021022211022100120020221000 |
4 | 113000223303032030001123 |
5 | 101231043400100323344 |
6 | 555123334121520043 |
7 | 30213416244506523 |
oct | 2700536316140133 |
9 | 437284270506830 |
10 | 101202100011099 |
11 | 2a27862a13972a |
12 | b42578a643023 |
13 | 4461417823869 |
14 | 1adc2ca1ca683 |
15 | ba7773a25a69 |
hex | 5c0af338c05b |
101202100011099 has 8 divisors (see below), whose sum is σ = 149929037053520. Its totient is φ = 67468066674048.
The previous prime is 101202100011091. The next prime is 101202100011211. The reversal of 101202100011099 is 990110001202101.
It is not a de Polignac number, because 101202100011099 - 23 = 101202100011091 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 3748225926337 = 101202100011099 / (1 + 0 + 1 + 2 + 0 + 2 + 1 + 0 + 0 + 0 + 1 + 1 + 0 + 9 + 9).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101202100011091) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1874112963142 + ... + 1874112963195.
It is an arithmetic number, because the mean of its divisors is an integer number (18741129631690).
Almost surely, 2101202100011099 is an apocalyptic number.
101202100011099 is a deficient number, since it is larger than the sum of its proper divisors (48726937042421).
101202100011099 is an equidigital number, since it uses as much as digits as its factorization.
101202100011099 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3748225926346 (or 3748225926340 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 27.
The spelling of 101202100011099 in words is "one hundred one trillion, two hundred two billion, one hundred million, eleven thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •