Base | Representation |
---|---|
bin | 1100100011100011000… |
… | …00101011000110000011 |
3 | 1112020112002022112212010 |
4 | 12101301200223012003 |
5 | 24032002141321011 |
6 | 530103303104003 |
7 | 43111344006132 |
oct | 6216140530603 |
9 | 1466462275763 |
10 | 431401120131 |
11 | 156a5775a753 |
12 | 6b737442003 |
13 | 318b10849b7 |
14 | 16c46731919 |
15 | b34d5391a6 |
hex | 647182b183 |
431401120131 has 16 divisors (see below), whose sum is σ = 582206333184. Its totient is φ = 284099216544.
The previous prime is 431401120123. The next prime is 431401120151. The reversal of 431401120131 is 131021104134.
It is not a de Polignac number, because 431401120131 - 23 = 431401120123 is a prime.
It is a super-2 number, since 2×4314011201312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 431401120098 and 431401120107.
It is not an unprimeable number, because it can be changed into a prime (431401120151) 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, 1906545 + ... + 2120781.
It is an arithmetic number, because the mean of its divisors is an integer number (36387895824).
Almost surely, 2431401120131 is an apocalyptic number.
431401120131 is a deficient number, since it is larger than the sum of its proper divisors (150805213053).
431401120131 is a wasteful number, since it uses less digits than its factorization.
431401120131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 222410.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 431401120131 its reverse (131021104134), we get a palindrome (562422224265).
It can be divided in two parts, 431401120 and 131, that added together give a triangular number (431401251 = T29373).
The spelling of 431401120131 in words is "four hundred thirty-one billion, four hundred one million, one hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •