Base | Representation |
---|---|
bin | 1101011000110100111… |
… | …1110110110111000110 |
3 | 210222200022020120012120 |
4 | 3112031033312313012 |
5 | 12232021232323024 |
6 | 253354550430410 |
7 | 22421455223220 |
oct | 3261517666706 |
9 | 728608216176 |
10 | 230003011014 |
11 | 895a8781477 |
12 | 386ab662406 |
13 | 188c61c992a |
14 | b1bcab1410 |
15 | 5eb2495479 |
hex | 358d3f6dc6 |
230003011014 has 64 divisors (see below), whose sum is σ = 531282931200. Its totient is φ = 65020290048.
The previous prime is 230003010997. The next prime is 230003011093. The reversal of 230003011014 is 410110300032.
It is a junction number, because it is equal to n+sod(n) for n = 230003010984 and 230003011002.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 27980197 + ... + 27988415.
It is an arithmetic number, because the mean of its divisors is an integer number (8301295800).
Almost surely, 2230003011014 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 230003011014, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (265641465600).
230003011014 is an abundant number, since it is smaller than the sum of its proper divisors (301279920186).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230003011014 is a wasteful number, since it uses less digits than its factorization.
230003011014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15197.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 230003011014 its reverse (410110300032), we get a palindrome (640113311046).
The spelling of 230003011014 in words is "two hundred thirty billion, three million, eleven thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •