Base | Representation |
---|---|
bin | 1001111010001001001… |
… | …01101011101101010111 |
3 | 1012112202202122201220201 |
4 | 10331010211223231113 |
5 | 21034222001123211 |
6 | 420222500241331 |
7 | 33411513663010 |
oct | 4750445535527 |
9 | 1175682581821 |
10 | 340453145431 |
11 | 121426a1a1a3 |
12 | 55b950a0247 |
13 | 26148a3c759 |
14 | 1269998a007 |
15 | 8cc8d560c1 |
hex | 4f4496bb57 |
340453145431 has 8 divisors (see below), whose sum is σ = 399605236640. Its totient is φ = 283930036128.
The previous prime is 340453145429. The next prime is 340453145447. The reversal of 340453145431 is 134541354043.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 340453145431 - 21 = 340453145429 is a prime.
It is a super-2 number, since 2×3404531454312 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (340453145231) 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, 657245196 + ... + 657245713.
It is an arithmetic number, because the mean of its divisors is an integer number (49950654580).
Almost surely, 2340453145431 is an apocalyptic number.
340453145431 is a deficient number, since it is larger than the sum of its proper divisors (59152091209).
340453145431 is a wasteful number, since it uses less digits than its factorization.
340453145431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1314490953.
The product of its (nonzero) digits is 172800, while the sum is 37.
Adding to 340453145431 its reverse (134541354043), we get a palindrome (474994499474).
The spelling of 340453145431 in words is "three hundred forty billion, four hundred fifty-three million, one hundred forty-five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •