Base | Representation |
---|---|
bin | 1100101000011000110… |
… | …10110001000100010101 |
3 | 1112111020012122100222110 |
4 | 12110030122301010111 |
5 | 24102313002241323 |
6 | 531213223021233 |
7 | 43232632321455 |
oct | 6241432610425 |
9 | 1474205570873 |
10 | 434000040213 |
11 | 158070787893 |
12 | 7014189a819 |
13 | 31c0663a22c |
14 | 17011971d65 |
15 | b4517a4793 |
hex | 650c6b1115 |
434000040213 has 8 divisors (see below), whose sum is σ = 592124086048. Its totient is φ = 282604677264.
The previous prime is 434000040191. The next prime is 434000040217. The reversal of 434000040213 is 312040000434.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 434000040213 - 29 = 434000039701 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 434000040213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (434000040217) 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, 1682170570 + ... + 1682170827.
It is an arithmetic number, because the mean of its divisors is an integer number (74015510756).
Almost surely, 2434000040213 is an apocalyptic number.
434000040213 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
It is an amenable number.
434000040213 is a deficient number, since it is larger than the sum of its proper divisors (158124045835).
434000040213 is a wasteful number, since it uses less digits than its factorization.
434000040213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3364341443.
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 434000040213 its reverse (312040000434), we get a palindrome (746040040647).
The spelling of 434000040213 in words is "four hundred thirty-four billion, forty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •