Base | Representation |
---|---|
bin | 1101011001001111101… |
… | …1000110110110100000 |
3 | 210222222002222210200020 |
4 | 3112103323012312200 |
5 | 12232233420341000 |
6 | 253414031153440 |
7 | 22424315220546 |
oct | 3262373066640 |
9 | 728862883606 |
10 | 230115012000 |
11 | 89655a1a475 |
12 | 38721075880 |
13 | 189134829c3 |
14 | b1cd907d96 |
15 | 5ebc21aba0 |
hex | 3593ec6da0 |
230115012000 has 192 divisors, whose sum is σ = 754486596864. Its totient is φ = 61312742400.
The previous prime is 230115011989. The next prime is 230115012053. The reversal of 230115012000 is 210511032.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15628642 + ... + 15643358.
It is an arithmetic number, because the mean of its divisors is an integer number (3929617692).
Almost surely, 2230115012000 is an apocalyptic number.
230115012000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 230115012000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (377243298432).
230115012000 is an abundant number, since it is smaller than the sum of its proper divisors (524371584864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230115012000 is a wasteful number, since it uses less digits than its factorization.
230115012000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16048 (or 16030 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 15.
Adding to 230115012000 its reverse (210511032), we get a palindrome (230325523032).
The spelling of 230115012000 in words is "two hundred thirty billion, one hundred fifteen million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •