Base | Representation |
---|---|
bin | 110100010111100110001101… |
… | …111010100111110111101010 |
3 | 1010012111101011221221001011012 |
4 | 310113212031322213313222 |
5 | 220142030331030444424 |
6 | 2133503314234303522 |
7 | 66341033235610355 |
oct | 6427461572476752 |
9 | 1105441157831135 |
10 | 230320002203114 |
11 | 674291898a497a |
12 | 219b9686887ba2 |
13 | 9b691104c6375 |
14 | 40c379480d29c |
15 | 1b9624257ab0e |
hex | d1798dea7dea |
230320002203114 has 8 divisors (see below), whose sum is σ = 345480086286720. Its totient is φ = 115159973440876.
The previous prime is 230320002203069. The next prime is 230320002203143. The reversal of 230320002203114 is 411302200023032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2303200022031142 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 230320002203114.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1065944 + ... + 21488979.
It is an arithmetic number, because the mean of its divisors is an integer number (43185010785840).
Almost surely, 2230320002203114 is an apocalyptic number.
230320002203114 is a deficient number, since it is larger than the sum of its proper divisors (115160084083606).
230320002203114 is a wasteful number, since it uses less digits than its factorization.
230320002203114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27660684.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 230320002203114 its reverse (411302200023032), we get a palindrome (641622202226146).
The spelling of 230320002203114 in words is "two hundred thirty trillion, three hundred twenty billion, two million, two hundred three thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •