Base | Representation |
---|---|
bin | 110100010100101110110101… |
… | …101101010111011101001000 |
3 | 1010011210112221121011212012220 |
4 | 310110232311231113131020 |
5 | 220130314102414233112 |
6 | 2133233032053134040 |
7 | 66320562655665513 |
oct | 6424566555273510 |
9 | 1104715847155186 |
10 | 230123101321032 |
11 | 67362728442957 |
12 | 2198749502a320 |
13 | 9b5369128389a |
14 | 40b8036175d7a |
15 | 1b9106b22898c |
hex | d14bb5b57748 |
230123101321032 has 32 divisors (see below), whose sum is σ = 586162616575680. Its totient is φ = 75260385337280.
The previous prime is 230123101320989. The next prime is 230123101321081.
230123101321032 is nontrivially palindromic in base 10.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 230123101320993 and 230123101321011.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 90457192644 + ... + 90457195187.
It is an arithmetic number, because the mean of its divisors is an integer number (18317581767990).
Almost surely, 2230123101321032 is an apocalyptic number.
It is an amenable number.
230123101321032 is an abundant number, since it is smaller than the sum of its proper divisors (356039515254648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230123101321032 is a wasteful number, since it uses less digits than its factorization.
230123101321032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 180914387893 (or 180914387889 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
It can be divided in two parts, 23012310 and 1321032, that added together give a palindrome (24333342).
The spelling of 230123101321032 in words is "two hundred thirty trillion, one hundred twenty-three billion, one hundred one million, three hundred twenty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •