Base | Representation |
---|---|
bin | 1100100000001010… |
… | …1100101010100001 |
3 | 22122220012002212220 |
4 | 3020002230222201 |
5 | 23333133303213 |
6 | 1313005541253 |
7 | 146111544066 |
oct | 31002545241 |
9 | 8586162786 |
10 | 3356150433 |
11 | 1472506549 |
12 | 797b74829 |
13 | 41641203c |
14 | 23ba34c6d |
15 | 149994e23 |
hex | c80acaa1 |
3356150433 has 8 divisors (see below), whose sum is σ = 4521000288. Its totient is φ = 2214367104.
The previous prime is 3356150431. The next prime is 3356150437. The reversal of 3356150433 is 3340516533.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3356150433 - 21 = 3356150431 is a prime.
It is a super-2 number, since 2×33561504332 = 22527491457852174978, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3356150394 and 3356150403.
It is not an unprimeable number, because it can be changed into a prime (3356150431) 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, 5766291 + ... + 5766872.
It is an arithmetic number, because the mean of its divisors is an integer number (565125036).
Almost surely, 23356150433 is an apocalyptic number.
It is an amenable number.
3356150433 is a deficient number, since it is larger than the sum of its proper divisors (1164849855).
3356150433 is a wasteful number, since it uses less digits than its factorization.
3356150433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11533263.
The product of its (nonzero) digits is 48600, while the sum is 33.
The square root of 3356150433 is about 57932.2917982709. The cubic root of 3356150433 is about 1497.2022565543.
Adding to 3356150433 its reverse (3340516533), we get a palindrome (6696666966).
The spelling of 3356150433 in words is "three billion, three hundred fifty-six million, one hundred fifty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •