Base | Representation |
---|---|
bin | 100100101000101101100… |
… | …1110001010011010010110 |
3 | 122211100210222112202201200 |
4 | 1021101123032022122112 |
5 | 1124444123410011410 |
6 | 14413053110533330 |
7 | 1026532513520520 |
oct | 111213316123226 |
9 | 18740728482650 |
10 | 5035232110230 |
11 | 1671480292433 |
12 | 693a41067246 |
13 | 2a6a8840587a |
14 | 1359c6a32a10 |
15 | 8aea08503c0 |
hex | 4945b38a696 |
5035232110230 has 96 divisors (see below), whose sum is σ = 15280169508864. Its totient is φ = 1126422739008.
The previous prime is 5035232110199. The next prime is 5035232110231. The reversal of 5035232110230 is 320112325305.
It is a happy number.
5035232110230 is a `hidden beast` number, since 5 + 0 + 3 + 523 + 2 + 1 + 102 + 30 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 5035232110194 and 5035232110203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5035232110231) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 84996262 + ... + 85055481.
It is an arithmetic number, because the mean of its divisors is an integer number (159168432384).
Almost surely, 25035232110230 is an apocalyptic number.
5035232110230 is an abundant number, since it is smaller than the sum of its proper divisors (10244937398634).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5035232110230 is a wasteful number, since it uses less digits than its factorization.
5035232110230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 170051810 (or 170051807 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
Adding to 5035232110230 its reverse (320112325305), we get a palindrome (5355344435535).
The spelling of 5035232110230 in words is "five trillion, thirty-five billion, two hundred thirty-two million, one hundred ten thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •