Base | Representation |
---|---|
bin | 1011101101100110110… |
… | …11100101111000001111 |
3 | 1102110202220012201220102 |
4 | 11312303123211320033 |
5 | 23043200213010411 |
6 | 504513543241315 |
7 | 41034616135520 |
oct | 5666333457017 |
9 | 1373686181812 |
10 | 402442313231 |
11 | 145747215492 |
12 | 65bb514923b |
13 | 2bc476206ba |
14 | 1569a6b8847 |
15 | a70602bd3b |
hex | 5db36e5e0f |
402442313231 has 8 divisors (see below), whose sum is σ = 467473975584. Its totient is φ = 339295626720.
The previous prime is 402442313179. The next prime is 402442313279. The reversal of 402442313231 is 132313244204.
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 402442313231 - 26 = 402442313167 is a prime.
It is a super-2 number, since 2×4024423132312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 402442313194 and 402442313203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (402442313291) 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, 471243500 + ... + 471244353.
It is an arithmetic number, because the mean of its divisors is an integer number (58434246948).
Almost surely, 2402442313231 is an apocalyptic number.
402442313231 is a deficient number, since it is larger than the sum of its proper divisors (65031662353).
402442313231 is an equidigital number, since it uses as much as digits as its factorization.
402442313231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 942487921.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 402442313231 its reverse (132313244204), we get a palindrome (534755557435).
The spelling of 402442313231 in words is "four hundred two billion, four hundred forty-two million, three hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •