Base | Representation |
---|---|
bin | 110100010101111001011100… |
… | …101111111110000110011011 |
3 | 1010012002012201201211111001010 |
4 | 310111321130233332012123 |
5 | 220133122140040210021 |
6 | 2133333521325025003 |
7 | 66326430136550166 |
oct | 6425713457760633 |
9 | 1105065651744033 |
10 | 230203213210011 |
11 | 673936a8520868 |
12 | 2199ab123b5163 |
13 | 9b5b0ba6327a2 |
14 | 40bbc75b18add |
15 | 1b931a9449976 |
hex | d15e5cbfe19b |
230203213210011 has 16 divisors (see below), whose sum is σ = 320315179207680. Its totient is φ = 146781380000640.
The previous prime is 230203213209979. The next prime is 230203213210037. The reversal of 230203213210011 is 110012312302032.
It is not a de Polignac number, because 230203213210011 - 25 = 230203213209979 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 230203213210011.
It is not an unprimeable number, because it can be changed into a prime (230203213215011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 168312846 + ... + 169675043.
It is an arithmetic number, because the mean of its divisors is an integer number (20019698700480).
Almost surely, 2230203213210011 is an apocalyptic number.
230203213210011 is a deficient number, since it is larger than the sum of its proper divisors (90111965997669).
230203213210011 is a wasteful number, since it uses less digits than its factorization.
230203213210011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337997786.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 230203213210011 its reverse (110012312302032), we get a palindrome (340215525512043).
The spelling of 230203213210011 in words is "two hundred thirty trillion, two hundred three billion, two hundred thirteen million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •