Base | Representation |
---|---|
bin | 10111010001000000000000… |
… | …000101100000000111111001 |
3 | 111102022000022212111000020120 |
4 | 113101000000011200013321 |
5 | 101402431110342132301 |
6 | 1001342402014043453 |
7 | 30360420550651041 |
oct | 2721000005400771 |
9 | 442260285430216 |
10 | 102323302302201 |
11 | 2a67008364a852 |
12 | b586b36aa9589 |
13 | 451307a0c09c6 |
14 | 1b3a68d504721 |
15 | bc69e5a81e36 |
hex | 5d10001601f9 |
102323302302201 has 8 divisors (see below), whose sum is σ = 137638424336160. Its totient is φ = 67611857568192.
The previous prime is 102323302302197. The next prime is 102323302302257. The reversal of 102323302302201 is 102203203323201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102323302302201 - 22 = 102323302302197 is a prime.
It is a super-2 number, since 2×1023233023022012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102323302306201) 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, 150919324591 + ... + 150919325268.
It is an arithmetic number, because the mean of its divisors is an integer number (17204803042020).
Almost surely, 2102323302302201 is an apocalyptic number.
It is an amenable number.
102323302302201 is a deficient number, since it is larger than the sum of its proper divisors (35315122033959).
102323302302201 is a wasteful number, since it uses less digits than its factorization.
102323302302201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 301838649975.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 102323302302201 its reverse (102203203323201), we get a palindrome (204526505625402).
The spelling of 102323302302201 in words is "one hundred two trillion, three hundred twenty-three billion, three hundred two million, three hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •