Base | Representation |
---|---|
bin | 1101011001111100100… |
… | …0010001100111010100 |
3 | 211000110012202021000112 |
4 | 3112133020101213110 |
5 | 12233130032411312 |
6 | 253444424502152 |
7 | 22432060212440 |
oct | 3263710214724 |
9 | 730405667015 |
10 | 230303013332 |
11 | 89742057677 |
12 | 3877401a958 |
13 | 189433c87b2 |
14 | b20a885820 |
15 | 5ecd9a4d22 |
hex | 359f2119d4 |
230303013332 has 48 divisors (see below), whose sum is σ = 489139271040. Its totient is φ = 92678971392.
The previous prime is 230303013301. The next prime is 230303013371. The reversal of 230303013332 is 233310303032.
230303013332 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 230303013298 and 230303013307.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1855373 + ... + 1975604.
It is an arithmetic number, because the mean of its divisors is an integer number (10190401480).
Almost surely, 2230303013332 is an apocalyptic number.
It is an amenable number.
230303013332 is an abundant number, since it is smaller than the sum of its proper divisors (258836257708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230303013332 is a wasteful number, since it uses less digits than its factorization.
230303013332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3831120 (or 3831118 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 23.
Adding to 230303013332 its reverse (233310303032), we get a palindrome (463613316364).
The spelling of 230303013332 in words is "two hundred thirty billion, three hundred three million, thirteen thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •