Base | Representation |
---|---|
bin | 11001000100000011111000… |
… | …101100100111101100011001 |
3 | 112110021220110002011112210120 |
4 | 121010003320230213230121 |
5 | 103422002434030143113 |
6 | 1030235021050103453 |
7 | 32134604304036642 |
oct | 3104037054475431 |
9 | 473256402145716 |
10 | 110230213131033 |
11 | 32139409686976 |
12 | 1044342b41ab89 |
13 | 4967883b89758 |
14 | 1d312568aa6c9 |
15 | cb251a360a23 |
hex | 6440f8b27b19 |
110230213131033 has 8 divisors (see below), whose sum is σ = 150100715753088. Its totient is φ = 71923259631504.
The previous prime is 110230213130981. The next prime is 110230213131041. The reversal of 110230213131033 is 330131312032011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110230213131033 - 26 = 110230213130969 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110230213130994 and 110230213131012.
It is not an unprimeable number, because it can be changed into a prime (110230213151033) 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, 390887280466 + ... + 390887280747.
It is an arithmetic number, because the mean of its divisors is an integer number (18762589469136).
Almost surely, 2110230213131033 is an apocalyptic number.
It is an amenable number.
110230213131033 is a deficient number, since it is larger than the sum of its proper divisors (39870502622055).
110230213131033 is an equidigital number, since it uses as much as digits as its factorization.
110230213131033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 781774561263.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 110230213131033 its reverse (330131312032011), we get a palindrome (440361525163044).
The spelling of 110230213131033 in words is "one hundred ten trillion, two hundred thirty billion, two hundred thirteen million, one hundred thirty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.422 sec. • engine limits •