Base | Representation |
---|---|
bin | 101111101101011011… |
… | …1101000001000111111 |
3 | 100210110100112102221222 |
4 | 1133122313220020333 |
5 | 3134312300410411 |
6 | 115022345143555 |
7 | 10254650603540 |
oct | 1373267501077 |
9 | 323410472858 |
10 | 102456263231 |
11 | 3a4a6987013 |
12 | 17a3448abbb |
13 | 987a66753a |
14 | 4d5d3684c7 |
15 | 29e9bc64db |
hex | 17dade823f |
102456263231 has 12 divisors (see below), whose sum is σ = 118765336656. Its totient is φ = 86582727840.
The previous prime is 102456263213. The next prime is 102456263251. The reversal of 102456263231 is 132362654201.
It is not a de Polignac number, because 102456263231 - 214 = 102456246847 is a prime.
It is a super-2 number, since 2×1024562632312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102456263191 and 102456263200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102456263201) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 1416470 + ... + 1487043.
It is an arithmetic number, because the mean of its divisors is an integer number (9897111388).
Almost surely, 2102456263231 is an apocalyptic number.
102456263231 is a deficient number, since it is larger than the sum of its proper divisors (16309073425).
102456263231 is an frugal number, since it uses more digits than its factorization.
102456263231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2903662 (or 2903591 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 35.
The spelling of 102456263231 in words is "one hundred two billion, four hundred fifty-six million, two hundred sixty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •