Base | Representation |
---|---|
bin | 101111101001001001… |
… | …0001110010100110001 |
3 | 100210002022112022211021 |
4 | 1133102102032110301 |
5 | 3134013413143213 |
6 | 115000202215441 |
7 | 10251251460154 |
oct | 1372222162461 |
9 | 323068468737 |
10 | 102312240433 |
11 | 3a432657607 |
12 | 179b41b4581 |
13 | 985687c150 |
14 | 4d48197c9b |
15 | 29dc227d8d |
hex | 17d248e531 |
102312240433 has 8 divisors (see below), whose sum is σ = 110225981376. Its totient is φ = 94404723600.
The previous prime is 102312240431. The next prime is 102312240451. The reversal of 102312240433 is 334042213201.
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 102312240433 - 21 = 102312240431 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102312240398 and 102312240407.
It is not an unprimeable number, because it can be changed into a prime (102312240431) 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, 1521853 + ... + 1587658.
It is an arithmetic number, because the mean of its divisors is an integer number (13778247672).
Almost surely, 2102312240433 is an apocalyptic number.
102312240433 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
102312240433 is a deficient number, since it is larger than the sum of its proper divisors (7913740943).
102312240433 is a wasteful number, since it uses less digits than its factorization.
102312240433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3112055.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 102312240433 its reverse (334042213201), we get a palindrome (436354453634).
The spelling of 102312240433 in words is "one hundred two billion, three hundred twelve million, two hundred forty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •