Base | Representation |
---|---|
bin | 10111010001000110010001… |
… | …001110011100111110010101 |
3 | 111102022122200220011221101122 |
4 | 113101012101032130332111 |
5 | 101403033401232442323 |
6 | 1001345433505333325 |
7 | 30361046411050346 |
oct | 2721062116347625 |
9 | 442278626157348 |
10 | 102330032312213 |
11 | 2a672a175579a2 |
12 | b5882b4937245 |
13 | 45138b04a5554 |
14 | 1b3ab2b2600cd |
15 | bc6c8b818ec8 |
hex | 5d119139cf95 |
102330032312213 has 8 divisors (see below), whose sum is σ = 107830781694720. Its totient is φ = 96840778750560.
The previous prime is 102330032312197. The next prime is 102330032312231. The reversal of 102330032312213 is 312213230033201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102330032312213 - 24 = 102330032312197 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102330032312113) 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, 2873936933 + ... + 2873972538.
It is an arithmetic number, because the mean of its divisors is an integer number (13478847711840).
Almost surely, 2102330032312213 is an apocalyptic number.
It is an amenable number.
102330032312213 is a deficient number, since it is larger than the sum of its proper divisors (5500749382507).
102330032312213 is an equidigital number, since it uses as much as digits as its factorization.
102330032312213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5747910427.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 102330032312213 its reverse (312213230033201), we get a palindrome (414543262345414).
The spelling of 102330032312213 in words is "one hundred two trillion, three hundred thirty billion, thirty-two million, three hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.177 sec. • engine limits •