Base | Representation |
---|---|
bin | 1100100010111000010… |
… | …11101111011101000110 |
3 | 1112012121011000222121000 |
4 | 12101130023233131012 |
5 | 24030234041431210 |
6 | 530004002034130 |
7 | 43066440460104 |
oct | 6213413573506 |
9 | 1465534028530 |
10 | 431043311430 |
11 | 156893791786 |
12 | 6b657648946 |
13 | 31854bc6484 |
14 | 16c10dd0c74 |
15 | b32be0bac0 |
hex | 645c2ef746 |
431043311430 has 32 divisors (see below), whose sum is σ = 1149448831200. Its totient is φ = 114944882976.
The previous prime is 431043311423. The next prime is 431043311431. The reversal of 431043311430 is 34113340134.
431043311430 is a `hidden beast` number, since 4 + 310 + 4 + 3 + 311 + 4 + 30 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 431043311394 and 431043311403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (431043311431) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 798228085 + ... + 798228624.
It is an arithmetic number, because the mean of its divisors is an integer number (35920275975).
Almost surely, 2431043311430 is an apocalyptic number.
431043311430 is an abundant number, since it is smaller than the sum of its proper divisors (718405519770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
431043311430 is a wasteful number, since it uses less digits than its factorization.
431043311430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1596456725 (or 1596456719 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 431043311430 its reverse (34113340134), we get a palindrome (465156651564).
The spelling of 431043311430 in words is "four hundred thirty-one billion, forty-three million, three hundred eleven thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •