Base | Representation |
---|---|
bin | 110100010111100111001010… |
… | …000110110011111001111100 |
3 | 1010012111110210100002121201201 |
4 | 310113213022012303321330 |
5 | 220142034413034443400 |
6 | 2133504002350345244 |
7 | 66341100250163314 |
oct | 6427471206637174 |
9 | 1105443710077651 |
10 | 230321012031100 |
11 | 67429657920661 |
12 | 219b9908abb224 |
13 | 9b69241794a13 |
14 | 40c384c998444 |
15 | 1b962a104e06a |
hex | d179ca1b3e7c |
230321012031100 has 72 divisors (see below), whose sum is σ = 504532114003008. Its totient is φ = 91258403174400.
The previous prime is 230321012031091. The next prime is 230321012031127. The reversal of 230321012031100 is 1130210123032.
It is a super-2 number, since 2×2303210120311002 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11812141 + ... + 24498340.
It is an arithmetic number, because the mean of its divisors is an integer number (7007390472264).
Almost surely, 2230321012031100 is an apocalyptic number.
230321012031100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
230321012031100 is an abundant number, since it is smaller than the sum of its proper divisors (274211101971908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230321012031100 is a wasteful number, since it uses less digits than its factorization.
230321012031100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36311095 (or 36311088 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 230321012031100 its reverse (1130210123032), we get a palindrome (231451222154132).
The spelling of 230321012031100 in words is "two hundred thirty trillion, three hundred twenty-one billion, twelve million, thirty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •