Base | Representation |
---|---|
bin | 10111010000110100100011… |
… | …100001110011100010001111 |
3 | 111102020211121100011002212221 |
4 | 113100310203201303202033 |
5 | 101402230423034204130 |
6 | 1001333010254440211 |
7 | 30356504153210410 |
oct | 2720644341634217 |
9 | 442224540132787 |
10 | 102311012022415 |
11 | 2a665947053729 |
12 | b584686b03067 |
13 | 4511b6ba827c1 |
14 | 1b39c45123807 |
15 | bc6526ac287a |
hex | 5d0d2387388f |
102311012022415 has 16 divisors (see below), whose sum is σ = 140754870453312. Its totient is φ = 69934809832704.
The previous prime is 102311012022391. The next prime is 102311012022431. The reversal of 102311012022415 is 514220210113201.
It is a cyclic number.
It is not a de Polignac number, because 102311012022415 - 223 = 102311003633807 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102311012022415.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 4610669934 + ... + 4610692123.
It is an arithmetic number, because the mean of its divisors is an integer number (8797179403332).
Almost surely, 2102311012022415 is an apocalyptic number.
102311012022415 is a deficient number, since it is larger than the sum of its proper divisors (38443858430897).
102311012022415 is an equidigital number, since it uses as much as digits as its factorization.
102311012022415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9221362386.
The product of its (nonzero) digits is 960, while the sum is 25.
Adding to 102311012022415 its reverse (514220210113201), we get a palindrome (616531222135616).
The spelling of 102311012022415 in words is "one hundred two trillion, three hundred eleven billion, twelve million, twenty-two thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •