Base | Representation |
---|---|
bin | 11101001111101010… |
… | …000111011010110100 |
3 | 10000001101220211022000 |
4 | 131033222013122310 |
5 | 1003302202232242 |
6 | 22231524535300 |
7 | 2161102615533 |
oct | 351752073264 |
9 | 100041824260 |
10 | 31401211572 |
11 | 12354190025 |
12 | 6104251530 |
13 | 2c65779183 |
14 | 173c59431a |
15 | c3bb5ca4c |
hex | 74fa876b4 |
31401211572 has 24 divisors (see below), whose sum is σ = 81410548800. Its totient is φ = 10467070488.
The previous prime is 31401211537. The next prime is 31401211573. The reversal of 31401211572 is 27511210413.
31401211572 is a `hidden beast` number, since 31 + 40 + 1 + 21 + 1 + 572 = 666.
It is a super-2 number, since 2×314012115722 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31401211573) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 145375872 + ... + 145376087.
It is an arithmetic number, because the mean of its divisors is an integer number (3392106200).
Almost surely, 231401211572 is an apocalyptic number.
It is an amenable number.
31401211572 is an abundant number, since it is smaller than the sum of its proper divisors (50009337228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31401211572 is a wasteful number, since it uses less digits than its factorization.
31401211572 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 290751972 (or 290751964 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 27.
Adding to 31401211572 its reverse (27511210413), we get a palindrome (58912421985).
The spelling of 31401211572 in words is "thirty-one billion, four hundred one million, two hundred eleven thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •