Base | Representation |
---|---|
bin | 10111010001011000111010… |
… | …000110010111001011011011 |
3 | 111102101120100122100122110000 |
4 | 113101120322012113023123 |
5 | 101403400343111110021 |
6 | 1001402543423424043 |
7 | 30362355352425300 |
oct | 2721307206271333 |
9 | 442346318318400 |
10 | 102350045410011 |
11 | 2a680457412543 |
12 | b59015b155023 |
13 | 451574c7b7a59 |
14 | 1b3baa91950a7 |
15 | bc755d7c0b26 |
hex | 5d163a1972db |
102350045410011 has 60 divisors (see below), whose sum is σ = 177875271486000. Its totient is φ = 58479220689120.
The previous prime is 102350045410003. The next prime is 102350045410021. The reversal of 102350045410011 is 110014540053201.
102350045410011 is a `hidden beast` number, since 1 + 0 + 2 + 3 + 500 + 4 + 54 + 100 + 1 + 1 = 666.
It is not a de Polignac number, because 102350045410011 - 23 = 102350045410003 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (102350045410021) by changing a digit.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 34284241 + ... + 37149821.
It is an arithmetic number, because the mean of its divisors is an integer number (2964587858100).
Almost surely, 2102350045410011 is an apocalyptic number.
102350045410011 is a deficient number, since it is larger than the sum of its proper divisors (75525226075989).
102350045410011 is an equidigital number, since it uses as much as digits as its factorization.
102350045410011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2874606 (or 2874590 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 102350045410011 its reverse (110014540053201), we get a palindrome (212364585463212).
The spelling of 102350045410011 in words is "one hundred two trillion, three hundred fifty billion, forty-five million, four hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •