Base | Representation |
---|---|
bin | 1101011101010101100… |
… | …0011100000010100010 |
3 | 211002210122110112211200 |
4 | 3113111120130002202 |
5 | 12242011041020002 |
6 | 254115021422030 |
7 | 22463451641262 |
oct | 3272530340242 |
9 | 732718415750 |
10 | 231213220002 |
11 | 8a069920396 |
12 | 38988a0a916 |
13 | 18a59b56b1b |
14 | b2956db7a2 |
15 | 603384ab1c |
hex | 35d561c0a2 |
231213220002 has 48 divisors (see below), whose sum is σ = 519595714872. Its totient is φ = 74245593600.
The previous prime is 231213220001. The next prime is 231213220019. The reversal of 231213220002 is 200022312132.
231213220002 is a `hidden beast` number, since 231 + 213 + 220 + 0 + 0 + 2 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 187982077761 + 43231142241 = 433569^2 + 207921^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (231213220001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1651383 + ... + 1785914.
Almost surely, 2231213220002 is an apocalyptic number.
231213220002 is an abundant number, since it is smaller than the sum of its proper divisors (288382494870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
231213220002 is a wasteful number, since it uses less digits than its factorization.
231213220002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3437443 (or 3437440 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 231213220002 its reverse (200022312132), we get a palindrome (431235532134).
The spelling of 231213220002 in words is "two hundred thirty-one billion, two hundred thirteen million, two hundred twenty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •