Base | Representation |
---|---|
bin | 110100001110101110101101… |
… | …111100101010000111010000 |
3 | 1010010100010100110020211201210 |
4 | 310032232231330222013100 |
5 | 220102034404442021342 |
6 | 2132315341233100120 |
7 | 66246022103515122 |
oct | 6416565574520720 |
9 | 1103303313224653 |
10 | 229710654251472 |
11 | 67213817864a09 |
12 | 2191b5693b7640 |
13 | 9b23810c9bb34 |
14 | 40a20aac5b212 |
15 | 1b8547bbee79c |
hex | d0ebadf2a1d0 |
229710654251472 has 160 divisors (see below), whose sum is σ = 662495974686720. Its totient is φ = 68248804124160.
The previous prime is 229710654251471. The next prime is 229710654251543. The reversal of 229710654251472 is 274152456017922.
It is a super-2 number, since 2×2297106542514722 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (229710654251471) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 88483728 + ... + 91042799.
It is an arithmetic number, because the mean of its divisors is an integer number (4140599841792).
Almost surely, 2229710654251472 is an apocalyptic number.
It is an amenable number.
229710654251472 is an abundant number, since it is smaller than the sum of its proper divisors (432785320435248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
229710654251472 is a wasteful number, since it uses less digits than its factorization.
229710654251472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179526641 (or 179526635 counting only the distinct ones).
The product of its (nonzero) digits is 16934400, while the sum is 57.
The spelling of 229710654251472 in words is "two hundred twenty-nine trillion, seven hundred ten billion, six hundred fifty-four million, two hundred fifty-one thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •