Base | Representation |
---|---|
bin | 1101010111101000110… |
… | …1110001101000101000 |
3 | 210221212001101210101122 |
4 | 3111322031301220220 |
5 | 12230343011320331 |
6 | 253303142434412 |
7 | 22410530136140 |
oct | 3257215615050 |
9 | 727761353348 |
10 | 229683698216 |
11 | 89454506aa5 |
12 | 38620732a08 |
13 | 18874cc944b |
14 | b18c511920 |
15 | 5e9441e17b |
hex | 357a371a28 |
229683698216 has 32 divisors (see below), whose sum is σ = 494094479040. Its totient is φ = 98052845568.
The previous prime is 229683698197. The next prime is 229683698219. The reversal of 229683698216 is 612896386922.
229683698216 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (62) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (229683698219) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 7965170 + ... + 7993953.
It is an arithmetic number, because the mean of its divisors is an integer number (15440452470).
Almost surely, 2229683698216 is an apocalyptic number.
It is an amenable number.
229683698216 is an abundant number, since it is smaller than the sum of its proper divisors (264410780824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
229683698216 is a wasteful number, since it uses less digits than its factorization.
229683698216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15959393 (or 15959389 counting only the distinct ones).
The product of its digits is 26873856, while the sum is 62.
The spelling of 229683698216 in words is "two hundred twenty-nine billion, six hundred eighty-three million, six hundred ninety-eight thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •